On the Constant Positive Linear Dependence Condition and Its Application to SQP Methods
From MaRDI portal
Publication:4509745
DOI10.1137/S1052623497326629zbMath0999.90037OpenAlexW1991359458MaRDI QIDQ4509745
Publication date: 19 October 2000
Published in: SIAM Journal on Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/s1052623497326629
global convergenceconstrained optimizationsuperlinear convergenceconstraint qualificationKKT pointfeasible SQP method
Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) Numerical methods based on nonlinear programming (49M37) Methods of successive quadratic programming type (90C55)
Related Items
First- and second-order optimality conditions for second-order cone and semidefinite programming under a constant rank condition, New insights and augmented Lagrangian algorithm for optimal portfolio liquidation with market impact, A Note on the McCormick Second-Order Constraint Qualification, A semismooth Newton based augmented Lagrangian method for nonsmooth optimization on matrix manifolds, Newton-type methods for constrained optimization with nonregular constraints, Weak notions of nondegeneracy in nonlinear semidefinite programming, Mordukhovich stationarity for mathematical programs with switching constraints under weak constraint qualifications, A Stabilized Sequential Quadratic Programming Method for Optimization Problems in Function Spaces, Constraint qualifications in terms of convexificators for nonsmooth programming problems with mixed constraints, Optimality conditions for nonlinear second-order cone programming and symmetric cone programming, On sequential optimality conditions for smooth constrained optimization, On Optimality Conditions for Nonlinear Conic Programming, Nonregular mixed-constrained optimization problems, An approximate strong KKT condition for multiobjective optimization, A fast convergent sequential linear equation method for inequality constrained optimization without strict complementarity, Convergence of a local regularization approach for mathematical programmes with complementarity or vanishing constraints, On scaled stopping criteria for a safeguarded augmented Lagrangian method with theoretical guarantees, A study of one-parameter regularization methods for mathematical programs with vanishing constraints, On the best achievable quality of limit points of augmented Lagrangian schemes, Sequential equality-constrained optimization for nonlinear programming, An augmented Lagrangian method exploiting an active-set strategy and second-order information, Mathematical programs with vanishing constraints: a new regularization approach with strong convergence properties, The boundedness of penalty parameters in an augmented Lagrangian method with constrained subproblems, A stabilized filter SQP algorithm for nonlinear programming, Second-order negative-curvature methods for box-constrained and general constrained optimization, Global convergence of modified augmented Lagrangian methods for nonlinear semidefinite programming, An augmented Lagrangian affine scaling method for nonlinear programming, Necessary optimality conditions for optimal control problems with nonsmooth mixed state and control constraints, A Cone-Continuity Constraint Qualification and Algorithmic Consequences, Relaxation approach for equilibrium problems with equilibrium constraints, A strongly convergent norm-relaxed method of strongly sub-feasible direction for optimization with nonlinear equality and inequality constraints, A modified homotopy method for solving the principal-agent bilevel programming problem, On the multiplier-penalty-approach for quasi-variational inequalities, Constraint qualifications and optimality conditions for optimization problems with cardinality constraints, Second-order optimality conditions for mathematical programs with equilibrium constraints, Constant-rank condition and second-order constraint qualification, Characterization of Tilt Stability via Subgradient Graphical Derivative with Applications to Nonlinear Programming, An augmented Lagrangian trust region method for equality constrained optimization, Strong and weak conditions of regularity and optimality, Enhanced Fritz John stationarity, new constraint qualifications and local error bound for mathematical programs with vanishing constraints, On the minimization of possibly discontinuous functions by means of pointwise approximations, Convergence of a stabilized SQP method for equality constrained optimization, An augmented Lagrangian method for quasi-equilibrium problems, Towards an efficient augmented Lagrangian method for convex quadratic programming, Solving Nonsmooth Bi-Objective Environmental andEconomic Dispatch Problem using Smoothing Techniques, Inexact restoration method for minimization problems arising in electronic structure calculations, Implications of the constant rank constraint qualification, The inexact log-exponential regularization method for mathematical programs with vertical complementarity constraints, A new sequential systems of linear equations algorithm of feasible descent for inequality constrained optimization, Theoretical and numerical comparison of relaxation methods for mathematical programs with complementarity constraints, An Augmented Lagrangian Method for Optimization Problems in Banach Spaces, Relaxed constant positive linear dependence constraint qualification and its application to bilevel programs, Augmented Lagrangian method with nonmonotone penalty parameters for constrained optimization, Handling infeasibility in a large-scale nonlinear optimization algorithm, Improved Convergence Properties of the Relaxation Schemes of Kadrani et al. and Kanzow and Schwartz for MPEC, On approximate KKT condition and its extension to continuous variational inequalities, A two-level distributed algorithm for nonconvex constrained optimization, Sequential constant rank constraint qualifications for nonlinear semidefinite programming with algorithmic applications, Globally convergent homotopy method for designing piecewise linear deterministic contractual function, On the approximate solutions of augmented subproblems within sequential methods for nonlinear programming, A new smoothing method for mathematical programs with complementarity constraints based on logarithm-exponential function, Improving ultimate convergence of an augmented Lagrangian method, Notes on convergence properties for a smoothing-regularization approach to mathematical programs with vanishing constraints, Low order-value approach for solving var-constrained optimization problems, A Sequential Optimality Condition Related to the Quasi-normality Constraint Qualification and Its Algorithmic Consequences, Global and local convergence of a nonmonotone SQP method for constrained nonlinear optimization, New results on constraint qualifications for nonlinear extremum problems and extensions, Enhanced Karush-Kuhn-Tucker conditions for mathematical programs with equilibrium constraints, On the behavior of Lagrange multipliers in convex and nonconvex infeasible interior point methods, A modified constraint shifting homotopy method for solving general nonlinear multiobjective programming, On optimization strategies for parameter estimation in models governed by partial differential equations, Smoothing augmented Lagrangian method for nonsmooth constrained optimization problems, Augmented Lagrangian methods under the constant positive linear dependence constraint qualification, Optimality Conditions and Constraint Qualifications for Generalized Nash Equilibrium Problems and Their Practical Implications, Augmented Lagrangians with constrained subproblems and convergence to second-order stationary points, Error estimation in nonlinear optimization, Structured minimal-memory inexact quasi-Newton method and secant preconditioners for augmented Lagrangian optimization, On error bounds for quasinormal programs, Unnamed Item, Mathematical Programs with Cardinality Constraints: Reformulation by Complementarity-Type Conditions and a Regularization Method, On second-order optimality conditions for nonlinear programming, A new line search inexact restoration approach for nonlinear programming, Addressing the greediness phenomenon in nonlinear programming by means of proximal augmented Lagrangians, Global convergence of a robust filter SQP algorithm, A feasible descent SQP algorithm for general constrained optimization without strict complemen\-tar\-ity, On the behaviour of constrained optimization methods when Lagrange multipliers do not exist, A smoothing Newton method for semi-infinite programming, A relaxed constant positive linear dependence constraint qualification and applications, On the relation between constant positive linear dependence condition and quasinormality constraint qualification, Quasi-Newton acceleration for equality-constrained minimization, Evaluation Complexity for Nonlinear Constrained Optimization Using Unscaled KKT Conditions and High-Order Models, A superlinearly convergent strongly sub-feasible SSLE-type algorithm with working set for nonlinearly constrained optimization, On the use of Jordan algebras for improving global convergence of an augmented Lagrangian method in nonlinear semidefinite programming, Sequential optimality conditions for cardinality-constrained optimization problems with applications, On error bounds and Newton-type methods for generalized Nash equilibrium problems, Optimality conditions and exact penalty for mathematical programs with switching constraints, Optimality conditions and global convergence for nonlinear semidefinite programming, On relaxing the Mangasarian-Fromovitz constraint qualification, An augmented Lagrangian algorithm for nonlinear semidefinite programming applied to the covering problem, Strict Constraint Qualifications and Sequential Optimality Conditions for Constrained Optimization, On relaxed constant rank regularity condition in mathematical programming, Augmented Lagrangian Methods for the Solution of Generalized Nash Equilibrium Problems, Low order-value optimization and applications, Regularity conditions in differentiable vector optimization revisited, Global convergence of algorithms under constant rank conditions for nonlinear second-order cone programming, A LOCALLY SMOOTHING METHOD FOR MATHEMATICAL PROGRAMS WITH COMPLEMENTARITY CONSTRAINTS, Mathematical programs with equilibrium constraints: a sequential optimality condition, new constraint qualifications and algorithmic consequences, MPEC Methods for Bilevel Optimization Problems, A flexible inexact-restoration method for constrained optimization, Relaxation schemes for mathematical programmes with switching constraints, Globally convergent homotopy algorithm for solving the KKT systems to the principal-agent bilevel programming, Naive constant rank-type constraint qualifications for multifold second-order cone programming and semidefinite programming, R-regularity of set-valued mappings under the relaxed constant positive linear dependence constraint qualification with applications to parametric and bilevel optimization
