Suchergebnisse - sequential linearly constrained nonlinear programming

Sequential equality-constrained optimization for nonlinear programming von Birgin, E. G., Bueno, L. F., Martínez, J. M.

“… In the spirit of sequential quadratic programming and sequential linearly-constrained programming, the new proposed approach approximately solves, at each iteration, an equality-constrained optimization problem …”
Volltext

CSOLNP: Numerical Optimization Engine for Solving Non-linearly Constrained Problems von Zahery, Mahsa, Maes, Hermine H., Neale, Michael C.

“… R package version, 1) alongside some improvements. CSOLNP solves non-linearly constrained optimization problems using a Sequential Quadratic Programming (SQP) algorithm. CSOLNP, NPSOL …”
Volltext

A primal-dual augmented Lagrangian von Gill, Philip E., Robinson, Daniel P.

“… Nonlinearly constrained optimization problems can be solved by minimizing a sequence of simpler unconstrained or linearly constrained subproblems …”
Volltext

Continuation methods with the trusty time-stepping scheme for linearly constrained optimization with noisy data von Luo, Xin-long, Lv, Jia-hui, Sun, Geng

“… the horizontal flight. In order to solve this practical problem efficiently, this paper constructs a continuation method with the trusty time-stepping scheme for the linearly equality-constrained optimization problem at every sampling time …”
Volltext

Newton-Type Methods: A Broader View von Izmailov, A. F., Solodov, M. V.

“… number of important algorithms for constrained optimization can be related to them by …”
Volltext

Continuation Method with the Trusty Time-stepping Scheme for Linearly Constrained Optimization with Noisy Data von Xin-long, Luo, Jia-hui, Lv, Sun, Geng

“… the horizontal flight. In order to solve this practical problem efficiently, this paper constructs a continuation method with the trusty time-stepping scheme for the linearly equality-constrained optimization problem at every sampling time …”
Volltext

Statistical Inference of Constrained Stochastic Optimization via Sketched Sequential Quadratic Programming von Sen, Na, Mahoney, Michael W

“… We consider online statistical inference of constrained stochastic nonlinear optimization problems …”
Volltext

Computation of optimal investment allocations in a sequential portfolio optimisation von Mavungu, Masiala, Hurwitz, Evan, Marwala, Tshilidzi

“… Orientation: This article is related to Financial Risk Management, Investment Management and Portfolio Optimisation. Research purpose: The aim is to compute …”
Volltext

A Truncated SQP Method Based on Inexact Interior-Point Solutions of Subproblems von Izmailov, A. F., Solodov, M. V.

“… We consider sequential quadratic programming (SQP) methods applied to optimization problems with nonlinear equality constraints and simple bounds …”
Volltext

A reduced SAND method for optimal design of non-linear structures von Orozco, Carlos E., Ghattas, Omar N.

“… An SQP‐based reduced Hessian method for simultaneous analysis and design (SAND) of non‐linearly behaving structures is presented and compared with conventional nested analysis and design …”
Volltext

A Globally Convergent Distributed Jacobi Scheme for Block-Structured Nonconvex Constrained Optimization Problems von Subramanyam, Anirudh, Kim, Youngdae, Schanen, Michel, Pacaud, François, Anitescu, Mihai

“… Motivated by the increasing availability of high-performance parallel computing, we design a distributed parallel algorithm for linearly-coupled block-structured nonconvex constrained optimization problems …”
Volltext

Feasible generalized monotone line search SQP algorithm for nonlinear minimax problems with inequality constraints von Jian, Jin-bao, Quan, Ran, Zhang, Xue-lu

“… In this paper, the nonlinear minimax problems with inequality constraints are discussed, and a sequential quadratic programming (SQP …”
Volltext

Data-Driven Batch Localization and SLAM Using Koopman Linearization von Guo, Zi Cong, Dumbgen, Frederike, Forbes, James Richard, Barfoot, Timothy D.

“… The problem is efficiently solved using a sequential …”
Volltext

Feasible Direction Methods for Constrained Nonlinear Optimization Suggestions for Improvements von Mitradjieva–Daneva, Maria

“… –Wolfe method is popular for solving certain structured linearly constrained nonlinear problems, although its rate of convergence is often poor …”
Volltext

Autocalibration and the absolute quadric von Triggs, B.

“… The author describes a new method for camera autocalibration and scaled Euclidean structure and motion, from three or more views taken by a moving camera with …”
Volltext

Exploiting Problem Structure for Faster Optimization: A Trilinear Saddle Point Approach von Zhang, Zhe

“… By effectively leveraging problem structure, our approach significantly improves computation complexities for a few important problem classes in stochastic programming and non-linear programming …”
Volltext

Data-Driven Batch Localization and SLAM Using Koopman Linearization von Zi Cong Guo, Dümbgen, Frederike, bes, James R, Barfoot, Timothy D

“… The problem is efficiently solved using a sequential quadratic program (SQP), where the complexity of an SQP iteration …”
Volltext

Length-preserved natural boundary for intrinsic parameterization von Wang, C.C.L.

“… Computation of a length-preserved natural boundary is formulated as a constrained non-linear optimization problem, the procedure of solving which is in general very time-consuming. Here, we speed up the optimization by adopting the scheme of sequential linearly constrained programming. It is shown at the end of this paper that our length-preserved natural boundary could greatly improve the speed and quality of the original intrinsic parameterization …”
Volltext

On the Extensions of the Predictor-Corrector Proximal Multiplier (PCPM) Algorithm and their Applications von Chen, Run

“… Many real-world application problems can be modeled mathematically as constrained convex optimization problems …”
Volltext

Multi-constraint multi-variable optimization of source-driven nuclear systems von Watkins, Edward Francis

“… The novel approach involves the replacement of the steepest-descents optimization algorithm incorporated in the code SWAN by a significantly more general and efficient sequential quadratic …”
Volltext