Strict Constraint Qualifications and Sequential Optimality Conditions for Constrained Optimization
From MaRDI portal
Publication:5219665
DOI10.1287/moor.2017.0879OpenAlexW2781490486MaRDI QIDQ5219665
Paulo J. S. Silva, Alberto Ramos, Roberto Andreani, José Mario Martínez
Publication date: 12 March 2020
Published in: Mathematics of Operations Research (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/ff4c63b048182dec456584ed5a0df3a96ebbb79f
Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) Optimality conditions and duality in mathematical programming (90C46) Optimality conditions (49K99)
Related Items
Asymptotic regularity for Lipschitzian nonlinear optimization problems with applications to complementarity constrained and bilevel programming, Multiobjective approximate gradient projection method for constrained vector optimization: sequential optimality conditions without constraint qualifications, On scaled stopping criteria for a safeguarded augmented Lagrangian method with theoretical guarantees, On the best achievable quality of limit points of augmented Lagrangian schemes, A second-order optimality condition with first- and second-order complementarity associated with global convergence of algorithms, On constraint qualifications for second-order optimality conditions depending on a single Lagrange multiplier, Necessary optimality conditions and exact penalization for non-Lipschitz nonlinear programs, On the convergence analysis of a penalty algorithm for nonsmooth optimization and its performance for solving hard-sphere problems, Some theoretical limitations of second-order algorithms for smooth constrained optimization, An augmented Lagrangian method for optimization problems with structured geometric constraints, A trust-region LP-Newton method for constrained nonsmooth equations under Hölder metric subregularity, Inexact restoration for minimization with inexact evaluation both of the objective function and the constraints, An augmented Lagrangian method for quasi-equilibrium problems, Non-monotone inexact restoration method for nonlinear programming, Inexact penalty decomposition methods for optimization problems with geometric constraints, The demand adjustment problem via inexact restoration method, On the fulfillment of the complementary approximate Karush-Kuhn-Tucker conditions and algorithmic applications, Optimality conditions for nonlinear second-order cone programming and symmetric cone programming, Stochastic first-order methods for convex and nonconvex functional constrained optimization, On the approximate solutions of augmented subproblems within sequential methods for nonlinear programming, A Sequential Optimality Condition Related to the Quasi-normality Constraint Qualification and Its Algorithmic Consequences, On the behavior of Lagrange multipliers in convex and nonconvex infeasible interior point methods, Optimality Conditions and Constraint Qualifications for Generalized Nash Equilibrium Problems and Their Practical Implications, Constraint qualifications for Karush-Kuhn-Tucker conditions in multiobjective optimization, New Sequential Optimality Conditions for Mathematical Programs with Complementarity Constraints and Algorithmic Consequences, A Shifted Primal-Dual Penalty-Barrier Method for Nonlinear Optimization, On the Complexity of an Inexact Restoration Method for 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, Optimality conditions and global convergence for nonlinear semidefinite programming, An augmented Lagrangian algorithm for nonlinear semidefinite programming applied to the covering problem, Strong duality in minimizing a quadratic form subject to two homogeneous quadratic inequalities over the unit sphere, Complexity and performance of an Augmented Lagrangian algorithm, Mathematical programs with equilibrium constraints: a sequential optimality condition, new constraint qualifications and algorithmic consequences, On Optimality Conditions for Nonlinear Conic Programming, A comparative study of sequential optimality conditions for mathematical programs with cardinality constraints
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Corrigendum to: ``On the complexity of finding first-order critical points in constrained nonlinear optimization
- On approximate KKT condition and its extension to continuous variational inequalities
- A relaxed constant positive linear dependence constraint qualification and applications
- Convex analysis and nonlinear optimization. Theory and examples.
- A new line search inexact restoration approach for nonlinear programming
- A practical optimality condition without constraint qualifications for nonlinear programming
- On the relation between constant positive linear dependence condition and quasinormality constraint qualification
- Pseudonormality and a Lagrange multiplier theory for constrained optimization
- Generalized order-value optimization
- Inexact-restoration algorithm for constrained optimization
- Assessing the reliability of general-purpose inexact restoration methods
- A flexible inexact-restoration method for constrained optimization
- On the complexity of finding first-order critical points in constrained nonlinear optimization
- On the implementation of an interior-point filter line-search algorithm for large-scale nonlinear programming
- Interior-point \(\ell_2\)-penalty methods for nonlinear programming with strong global convergence properties
- The Fritz John necessary optimality conditions in the presence of equality and inequality constraints
- A New Sequential Optimality Condition for Constrained Optimization and Algorithmic Consequences
- On relaxed constant rank regularity condition in mathematical programming
- A Cone-Continuity Constraint Qualification and Algorithmic Consequences
- On Augmented Lagrangian Methods with General Lower-Level Constraints
- Solution point differentiability without strict complementarity in nonlinear programming
- Variational Analysis
- On the Constant Positive Linear Dependence Condition and Its Application to SQP Methods
- Two New Weak Constraint Qualifications and Applications
- The Łojasiewicz Inequality for Nonsmooth Subanalytic Functions with Applications to Subgradient Dynamical Systems
- Practical Augmented Lagrangian Methods for Constrained Optimization
- Generalized Kuhn–Tucker Conditions for Mathematical Programming Problems in a Banach Space
- A Necessary and Sufficient Qualification for Constrained Optimization
- On sequential optimality conditions for smooth constrained optimization
- Set-valued analysis
- Inexact-restoration method with Lagrangian tangent decrease and new merit function for nonlinear programming.
