A Robust Algorithm for Optimization with General Equality and Inequality Constraints
From MaRDI portal
Publication:4509844
DOI10.1137/S1064827598334861zbMath0972.65038MaRDI QIDQ4509844
Publication date: 19 October 2000
Published in: SIAM Journal on Scientific Computing (Search for Journal in Brave)
convergencesuccessive quadratic programmingrobust algorithmSQP methodnumerical resultnonlinear constrained optimization
Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) Methods of successive quadratic programming type (90C55)
Related Items
Feasible generalized monotone line search SQP algorithm for nonlinear minimax problems with inequality constraints ⋮ Nonlinear programming without a penalty function or a filter ⋮ Robust optimality in constrained optimization problems with application in mechanics ⋮ Sequential penalty algorithm for nonlinear constrained optimization ⋮ Necessary and sufficient optimality conditions for some robust variational problems ⋮ Robust saddle‐point criterion in second‐order partial differential equation and partial differential inequation constrained control problems ⋮ A new sequential systems of linear equations algorithm of feasible descent for inequality constrained optimization ⋮ An overview of nonlinear optimization ⋮ 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 ⋮ An SQP method for minimization of locally Lipschitz functions with nonlinear constraints ⋮ Robust penalty function method for an uncertain multi-time control optimization problems ⋮ A kind of nonmonotone filter method for nonlinear complementarity problem ⋮ A feasible descent SQP algorithm for general constrained optimization without strict complemen\-tar\-ity ⋮ A robust trust region method for nonlinear optimization with inequality constraint ⋮ Global convergence on an active set SQP for inequality constrained optimization ⋮ A robust SQP method for mathematical programs with linear complementarity constraints ⋮ A new superlinearly convergent algorithm of combining QP subproblem with system of linear equations for nonlinear optimization ⋮ A robust SQP method based on a smoothing lower order penalty function† ⋮ Generalized monotone line search SQP algorithm for constrained minimax problems ⋮ A globally convergent primal-dual interior-point relaxation method for nonlinear programs ⋮ A sequential quadratic programming method for constrained multi-objective optimization problems ⋮ A modified SQP method with nonmonotone technique and its global convergence ⋮ A primal-dual interior-point method capable of rapidly detecting infeasibility for nonlinear programs ⋮ 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 ⋮ Global convergence analysis of line search interior-point methods for nonlinear programming without regularity assumptions ⋮ A wedge trust region method with self-correcting geometry for derivative-free optimization
Uses Software
