Degenerate Nonlinear Programming with a Quadratic Growth Condition
From MaRDI portal
Publication:4509754
DOI10.1137/S1052623499359178zbMath0994.65073MaRDI QIDQ4509754
Publication date: 19 October 2000
Published in: SIAM Journal on Optimization (Search for Journal in Brave)
algorithmsnumerical resultssequential quadratic programmingnonlinear programmingdegeneracyquadratic growthR-linear convergenceMangasarian-Fromovitz constraint qualification
Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) Methods of successive quadratic programming type (90C55)
Related Items
Effective reformulations of the truss topology design problem ⋮ Examples of dual behaviour of Newton-type methods on optimization problems with degenerate constraints ⋮ A stabilized filter SQP algorithm for nonlinear programming ⋮ Second-order negative-curvature methods for box-constrained and general constrained optimization ⋮ Quasi-contingent derivatives and studies of higher-orders in nonsmooth optimization ⋮ Leader-follower equilibria for electric power and \(\text{NO}_x\) allowances markets ⋮ Unnamed Item ⋮ Second-order optimality conditions for mathematical programs with equilibrium constraints ⋮ Constant-rank condition and second-order constraint qualification ⋮ An extension of Yuan's lemma and its applications in optimization ⋮ On constraint qualifications for second-order optimality conditions depending on a single Lagrange multiplier ⋮ Convergence analysis of a regularized interior point algorithm for the barrier problems with singular solutions ⋮ First- and second-order optimality conditions for second-order cone and semidefinite programming under a constant rank condition ⋮ Quaternion matrix decomposition and its theoretical implications ⋮ Asynchronous Stochastic Coordinate Descent: Parallelism and Convergence Properties ⋮ Newton-MR: inexact Newton method with minimum residual sub-problem solver ⋮ Newton-type methods for constrained optimization with nonregular constraints ⋮ Unnamed Item ⋮ Accelerated methods for weakly-quasi-convex optimization problems ⋮ On robust Karush-Kuhn-Tucker multipliers rules for semi-infinite multiobjective optimization with data uncertainty ⋮ Calabi-Polyak convexity theorem, Yuan'S lemma and S-lemma: extensions and applications ⋮ On second-order optimality conditions for vector optimization ⋮ Bounded sets of KKT multipliers in vector optimization ⋮ Global and local convergence of a nonmonotone SQP method for constrained nonlinear optimization ⋮ A linearly convergent stochastic recursive gradient method for convex optimization ⋮ Bounded sets of Lagrange multipliers for vector optimization problems in infinite dimension ⋮ AN INFEASIBLE SSLE FILTER ALGORITHM FOR GENERAL CONSTRAINED OPTIMIZATION WITHOUT STRICT COMPLEMENTARITY ⋮ Existence and boundedness of second-order Karush-Kuhn-Tucker multipliers for set-valued optimization with variable ordering structures ⋮ On attraction of Newton-type iterates to multipliers violating second-order sufficiency conditions ⋮ A reduced Hessian SQP method for inequality constrained optimization ⋮ Optimization problems with equilibrium constraints and their numerical solution. ⋮ On second-order optimality conditions for nonlinear programming ⋮ On the classical necessary second-order optimality conditions ⋮ Resolving learning rates adaptively by locating stochastic non-negative associated gradient projection points using line searches ⋮ A new result on second-order necessary conditions for nonlinear programming ⋮ A robust SQP method for mathematical programs with linear complementarity constraints ⋮ An application of matrix computations to classical second-order optimality conditions ⋮ On strong and weak second-order necessary optimality conditions for nonlinear programming ⋮ Karush-Kuhn-Tucker multiplier rules for efficient solutions of set-valued equilibrium problem with constraints ⋮ Convergence rate of block-coordinate maximization Burer-Monteiro method for solving large SDPs ⋮ First- and second-order necessary conditions via exact penalty functions ⋮ On second-order optimality conditions in nonlinear optimization ⋮ A superlinearly convergent implicit smooth SQP algorithm for mathematical programs with nonlinear complementarity constraints
Uses Software
