A robust sequential quadratic programming method

DOI10.1007/BF01582294zbMath0683.90070MaRDI QIDQ1825141

Yanyan Li

Publication date: 1989

Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)

zbMATH Keywords

sequential quadratic programmingconvergence proofinfeasiblefeasibility ensuring methodmodified quadratic subproblem

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) Quadratic programming (90C20)

Related Items

A decoupling approach for time-dependent robust optimization with application to power semiconductor devices, Exact barrier function methods for Lipschitz programs, Robust recursive quadratic programming algorithm model with global and superlinear convergence properties, An algorithm of sequential systems of linear equations for nonlinear optimization problems with arbitrary initial point, An interior point method for nonlinear programming with infeasibility detection capabilities, New sequential quadratic programming algorithm with consistent subproblems, Sequential Quadratic Optimization for Nonlinear Optimization Problems on Riemannian Manifolds, Sequential penalty algorithm for nonlinear constrained optimization, On the augmented subproblems within sequential methods for nonlinear programming, A sequential quadratic programming algorithm without a penalty function, a filter or a constraint qualification for inequality constrained optimization, A restoration-free filter SQP algorithm for equality constrained optimization, An Exact Penalty Method for Nonconvex Problems Covering, in Particular, Nonlinear Programming, Semidefinite Programming, and Second-Order Cone Programming, A Sequential Quadratic Programming Algorithm for Nonsmooth Problems with Upper- \({\boldsymbol{\mathcal{C}^2}}\) Objective, Dynamics and phase coordination of multi-module vibration-driven locomotion robots with linear or nonlinear connections, A line search exact penalty method using steering rules, A variant of SQP method for inequality constrained optimization and its global convergence, A null-space primal-dual interior-point algorithm for nonlinear optimization with nice convergence properties, Error bounds and finite termination for constrained optimization problems, A smoothing QP-free infeasible method for nonlinear inequality constrained optimization, A globally and superlinearly convergent modified SQP-filter method, Global and local convergence of a nonmonotone SQP method for constrained nonlinear optimization, Inexact Sequential Quadratic Optimization with Penalty Parameter Updates within the QP Solver, Augmented Lagrangian and exact penalty methods for quasi-variational inequalities, A modified SQP method and its global convergence, NE/SQP: A robust algorithm for the nonlinear complementarity problem, A trust region SQP-filter method for nonlinear second-order cone programming, Parameter optimization using the \(L_\infty \) exact penalty function and strictly convex quadratic programming problems, A new successive quadratic programming algorithm, Globally and superlinearly convergent QP-free algorithm for nonlinear constrained optimization, A kind of nonmonotone filter method for nonlinear complementarity problem, Global convergence of a robust filter SQP algorithm, Nonsmooth equation based BFGS method for solving KKT systems in mathematical programming, Interior-point \(\ell_2\)-penalty methods for nonlinear programming with strong global convergence properties, Global convergence on an active set SQP for inequality constrained optimization, A modified SQP-filter method and its global convergence, A new result on second-order necessary conditions for nonlinear programming, A robust SQP method for mathematical programs with linear complementarity constraints, A feasible filter SQP algorithm with global and local convergence, An inequality constrained nonlinear Kalman-Bucy smoother by interior point likelihood maximization, A superlinearly convergent strongly sub-feasible SSLE-type algorithm with working set for nonlinearly constrained optimization, Majorization-Minimization Procedures and Convergence of SQP Methods for Semi-Algebraic and Tame Programs, A robust SQP method based on a smoothing lower order penalty function†, A sequential quadratic programming method for constrained multi-objective optimization problems, An infeasible active-set QP-free algorithm for general nonlinear programming, Augmented Lagrangian Methods for the Solution of Generalized Nash Equilibrium Problems, Some new facts about sequential quadratic programming methods employing second derivatives, A modified SQP method with nonmonotone technique and its global convergence, A superlinearly convergent SSDP algorithm for nonlinear semidefinite programming, Globally and superlinearly convergent algorithms for the solution of box-constrained optimi\-zation, A primal-dual interior-point method capable of rapidly detecting infeasibility for nonlinear programs, On the numerical modeling of convex particle assemblies with friction, Smoothing SQP Methods for Solving Degenerate Nonsmooth Constrained Optimization Problems with Applications to Bilevel Programs, Ghost Penalties in Nonconvex Constrained Optimization: Diminishing Stepsizes and Iteration Complexity, A new technique for inconsistent QP problems in the SQP method, A superlinearly convergent implicit smooth SQP algorithm for mathematical programs with nonlinear complementarity constraints, Equality and inequality constrained optimization algorithms with convergent stepsizes, Analysis and implementation of a dual algorithm for constrained optimization, On sequential approximate simultaneous analysis and design in classical topology optimization, A SQP method for inequality constrained optimization., A novel augmented Lagrangian method of multipliers for optimization with general inequality constraints

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The nonlinear programming method of Wilson, Han, and Powell with an augmented Lagrangian type line search function. I. Convergence analysis
• A globally convergent method for nonlinear programming
• Optimization and nonsmooth analysis
• Descent methods for composite nondifferentiable optimization problems
• A Gauss-Newton Approach to Solving Generalized Inequalities
• Projected gradient methods for linearly constrained problems
• Exact penalty functions in nonlinear programming
• On conditions to have bounded multipliers in locally lipschitz programming
• A model algorithm for composite nondifferentiable optimization problems
• APPROXIMATIVE PROPERTIES OF SETS IN NORMED LINEAR SPACES
• Perturbed Kuhn-Tucker points and rates of convergence for a class of nonlinear-programming algorithms
• Stability Theory for Systems of Inequalities, Part II: Differentiable Nonlinear Systems
• A necessary and sufficient regularity condition to have bounded multipliers in nonconvex programming
• Superlinearly convergent quasi-newton algorithms for nonlinearly constrained optimization problems
• Superlinearly convergent variable metric algorithms for general nonlinear programming problems
• Algorithms for nonlinear constraints that use lagrangian functions
• A lower bound for the controlling parameters of the exact penalty functions