Optimality conditions for sparse nonlinear programming
From MaRDI portal
Publication:2361004
DOI10.1007/s11425-016-9010-xzbMath1365.90220OpenAlexW2592548932MaRDI QIDQ2361004
Jun Fan, Li-Li Pan, Nai-Hua Xiu
Publication date: 29 June 2017
Published in: Science China. Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11425-016-9010-x
normal coneconstraint qualificationfirst-order optimality conditionsecond-order optimality conditionsparse nonlinear programming
Nonconvex programming, global optimization (90C26) Nonlinear programming (90C30) Optimality conditions and duality in mathematical programming (90C46)
Related Items (12)
The smoothing objective penalty function method for two-cardinality sparse constrained optimization problems ⋮ Second-order optimality conditions and improved convergence results for regularization methods for cardinality-constrained optimization problems ⋮ Solution sets of three sparse optimization problems for multivariate regression ⋮ Normal Cones Intersection Rule and Optimality Analysis for Low-Rank Matrix Optimization with Affine Manifolds ⋮ Unnamed Item ⋮ On the linear independence constraint qualification in disjunctive programming ⋮ A quadratic penalty method for hypergraph matching ⋮ Lagrangian duality and saddle points for sparse linear programming ⋮ Matrix optimization over low-rank spectral sets: stationary points and local and global minimizers ⋮ A Lagrange-Newton algorithm for sparse nonlinear programming ⋮ Newton Hard-Thresholding Pursuit for Sparse Linear Complementarity Problem via A New Merit Function ⋮ On nondegenerate M-stationary points for sparsity constrained nonlinear optimization
Cites Work
- Unnamed Item
- Unnamed Item
- On solutions of sparsity constrained optimization
- The first-order necessary conditions for sparsity constrained optimization
- Constraint qualifications and optimality conditions for optimization problems with cardinality constraints
- Restricted normal cones and sparsity optimization with affine constraints
- Lipschitzian stability of parametric variational inequalities over generalized polyhedra in Banach spaces
- Iterative thresholding for sparse approximations
- Generalized differentiation of piecewise linear functions in second-order variational analysis
- Optimality conditions for disjunctive optimization in reflexive Banach spaces
- Optimality conditions for disjunctive programs with application to mathematical programs with equilibrium constraints
- On the Minimization Over Sparse Symmetric Sets: Projections, Optimality Conditions, and Algorithms
- Sparsity Constrained Nonlinear Optimization: Optimality Conditions and Algorithms
- On a Reformulation of Mathematical Programs with Cardinality Constraints
- Compressed Sensing With Nonlinear Observations and Related Nonlinear Optimization Problems
- Second-Order Analysis of Polyhedral Systems in Finite and Infinite Dimensions with Applications to Robust Stability of Variational Inequalities
- Decoding by Linear Programming
- Some continuity properties of polyhedral multifunctions
- Variational Analysis
- Exact Sparse Approximation Problems via Mixed-Integer Programming: Formulations and Computational Performance
- Characterizations of Strong Regularity for Variational Inequalities over Polyhedral Convex Sets
- Sparse Approximation via Penalty Decomposition Methods
- On calculating the normal cone to a finite union of convex polyhedra†
- Mathematical Programs with Cardinality Constraints: Reformulation by Complementarity-Type Conditions and a Regularization Method
- A Direct Formulation for Sparse PCA Using Semidefinite Programming
- Compressed sensing
This page was built for publication: Optimality conditions for sparse nonlinear programming
