Restricted Robinson constraint qualification and optimality for cardinality-constrained cone programming
type: Item
instance of: scholarly article
title: Restricted Robinson constraint qualification and optimality for cardinality-constrained cone programming
zbMATH Open document ID: 1386.90118
author: Ziyan Luo
author: Lili Pan
author: Naihua Xiu
published in: Journal of Optimization Theory and Applications
publication date: 2017-12-06T00:00:00Z
Mathematics Subject Classification ID: 90C26
Mathematics Subject Classification ID: 90C30
Mathematics Subject Classification ID: 90C46
zbMATH DE Number: 6815926
zbMATH Keywords: cardinality constraint
zbMATH Keywords: cone programming
zbMATH Keywords: optimality condition
zbMATH Keywords: constraint qualification
MaRDI profile type: Publication
full work available at URL: s10957-017-1166-4
OpenAlex ID: W2756157737
cites work: Optimality conditions for disjunctive programs with application to mathematical programs with equilibrium constraints
cites work: Q3174129
cites work: Computational study of a family of mixed-integer quadratic programming problems
cites work: Optimal cardinality constrained portfolio selection
cites work: A polynomial case of the cardinality-constrained quadratic optimization problem
cites work: OPTIMAL LOT SOLUTION TO CARDINALITY CONSTRAINED MEAN–VARIANCE FORMULATION FOR PORTFOLIO SELECTION
cites work: An efficient optimization approach for a cardinality-constrained index tracking problem
cites work: Compressed Sensing With Nonlinear Observations and Related Nonlinear Optimization Problems
cites work: Decoding by Linear Programming
cites work: Compressed sensing
cites work: RSP-Based Analysis for Sparsest and Least $\ell_1$-Norm Solutions to Underdetermined Linear Systems
cites work: Complexity of unconstrained \(L_2 - L_p\) minimization
cites work: Variable Selection via Nonconcave Penalized Likelihood and its Oracle Properties
cites work: Sparse recovery on Euclidean Jordan algebras
cites work: Nearly unbiased variable selection under minimax concave penalty
cites work: Restricted normal cones and sparsity optimization with affine constraints
cites work: Sparsity constrained nonlinear optimization: optimality conditions and algorithms
cites work: On the minimization over sparse symmetric sets: projections, optimality conditions, and algorithms
cites work: Mathematical Programs with Cardinality Constraints: Reformulation by Complementarity-Type Conditions and a Regularization Method
cites work: Constraint qualifications and optimality conditions for optimization problems with cardinality constraints
cites work: The first-order necessary conditions for sparsity constrained optimization
cites work: Sparse Approximation via Penalty Decomposition Methods
cites work: On solutions of sparsity constrained optimization
cites work: Algorithm for cardinality-constrained quadratic optimization
cites work: A Direct Formulation for Sparse PCA Using Semidefinite Programming
cites work: Exploiting sparsity in semidefinite programming via matrix completion. I: General framework
cites work: Q3093398
cites work: Variational Analysis
cites work: Q3996569
cites work: Q4503250
cites work: Convex Analysis
cites work: On regularity for constrained extremum problems. I: Sufficient optimality conditions
cites work: On regularity for constrained extremum problems. II: Necessary optimality conditions
DOI: 10.1007/S10957-017-1166-4
description: scientific article; zbMATH DE number 6815926