Sequential M-stationarity conditions for general optimization problems

Nonconvex programming, global optimization (90C26) Nonlinear programming (90C30) Optimality conditions and duality in mathematical programming (90C46) Nonsmooth analysis (49J52)

Cites Work

The first-order necessary conditions for sparsity constrained optimization
Restricted normal cones and sparsity optimization with affine constraints
Bounded Lagrange multiplier rules for general nonsmooth problems and application to mathematical programs with equilibrium constraints
Necessary and sufficient optimality conditions for mathematical programs with equilibrium constraints
On approximate KKT condition and its extension to continuous variational inequalities
Approximate Karush-Kuhn-Tucker condition in multiobjective optimization
Algorithm for cardinality-constrained quadratic optimization
A practical optimality condition without constraint qualifications for nonlinear programming
An approximate strong KKT condition for multiobjective optimization
Computational study of a family of mixed-integer quadratic programming problems
Inexact Newton methods for solving nonsmooth equations
Sequential optimality conditions for cardinality-constrained optimization problems with applications
Bounds on efficient outcomes for large-scale cardinality-constrained Markowitz problems
Naive constant rank-type constraint qualifications for multifold second-order cone programming and semidefinite programming
A comparative study of sequential optimality conditions for mathematical programs with cardinality constraints
Analysis of a new sequential optimality condition applied to mathematical programs with equilibrium constraints
Certifiably optimal sparse principal component analysis
Structural properties of affine sparsity constraints
A strong sequential optimality condition for cardinality-constrained optimization problems
Sparsity Constrained Nonlinear Optimization: Optimality Conditions and Algorithms
Some superlinearly convergent inexact generalized Newton method for solving nonsmooth equations
Calculus Without Derivatives
A New Sequential Optimality Condition for Constrained Optimization and Algorithmic Consequences
A Cone-Continuity Constraint Qualification and Algorithmic Consequences
Newton and Quasi-Newton Methods for a Class of Nonsmooth Equations and Related Problems
On the Constant Positive Linear Dependence Condition and Its Application to SQP Methods
Optimality conditions, approximate stationarity, and applications – a story beyond lipschitzness
New Constraint Qualifications for Optimization Problems in Banach Spaces Based on Asymptotic KKT Conditions
On the linear independence constraint qualification in disjunctive programming
New Sequential Optimality Conditions for Mathematical Programs with Complementarity Constraints and Algorithmic Consequences
Strict Constraint Qualifications and Sequential Optimality Conditions for Constrained Optimization
Practical Augmented Lagrangian Methods for Constrained Optimization
On Optimality Conditions for Nonlinear Conic Programming
Asymptotic regularity for Lipschitzian nonlinear optimization problems with applications to complementarity constrained and bilevel programming
On sequential optimality conditions for smooth constrained optimization
An augmented Lagrangian method for optimization problems with structured geometric constraints
Constrained composite optimization and augmented Lagrangian methods
Asymptotic stationarity and regularity for nonsmooth optimization problems

This page was built for publication: Sequential M-stationarity conditions for general optimization problems