Restricted Robinson constraint qualification and optimality for cardinality-constrained cone programming
From MaRDI portal
Publication:1682972
DOI10.1007/s10957-017-1166-4zbMath1386.90118OpenAlexW2756157737MaRDI QIDQ1682972
Ziyan Luo, Nai-Hua Xiu, Li-Li Pan
Publication date: 6 December 2017
Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10957-017-1166-4
Nonconvex programming, global optimization (90C26) Nonlinear programming (90C30) Optimality conditions and duality in mathematical programming (90C46)
Related Items (6)
The smoothing objective penalty function method for two-cardinality sparse constrained optimization problems ⋮ Normal Cones Intersection Rule and Optimality Analysis for Low-Rank Matrix Optimization with Affine Manifolds ⋮ Several Classes of Stationary Points for Rank Regularized Minimization Problems ⋮ Lagrangian duality and saddle points for sparse linear programming ⋮ Nonsmooth sparsity constrained optimization problems: optimality conditions ⋮ A Lagrange-Newton algorithm for sparse nonlinear programming
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Nearly unbiased variable selection under minimax concave penalty
- 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
- Sparse recovery on Euclidean Jordan algebras
- Algorithm for cardinality-constrained quadratic optimization
- On regularity for constrained extremum problems. I: Sufficient optimality conditions
- On regularity for constrained extremum problems. II: Necessary optimality conditions
- Computational study of a family of mixed-integer quadratic programming problems
- A polynomial case of the cardinality-constrained quadratic optimization problem
- Complexity of unconstrained \(L_2 - L_p\) minimization
- Optimality conditions for disjunctive programs with application to mathematical programs with equilibrium constraints
- Exploiting Sparsity in Semidefinite Programming via Matrix Completion I: General Framework
- On the Minimization Over Sparse Symmetric Sets: Projections, Optimality Conditions, and Algorithms
- An efficient optimization approach for a cardinality-constrained index tracking problem
- Optimal Cardinality Constrained Portfolio Selection
- Sparsity Constrained Nonlinear Optimization: Optimality Conditions and Algorithms
- Compressed Sensing With Nonlinear Observations and Related Nonlinear Optimization Problems
- Decoding by Linear Programming
- Variational Analysis
- Variable Selection via Nonconcave Penalized Likelihood and its Oracle Properties
- RSP-Based Analysis for Sparsest and Least $\ell_1$-Norm Solutions to Underdetermined Linear Systems
- Sparse Approximation via Penalty Decomposition Methods
- OPTIMAL LOT SOLUTION TO CARDINALITY CONSTRAINED MEAN–VARIANCE FORMULATION FOR PORTFOLIO SELECTION
- Convex Analysis
- 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: Restricted Robinson constraint qualification and optimality for cardinality-constrained cone programming
