Related references
Note: Only part of the references are listed.On the smoothing of the norm objective penalty function for two-cardinality sparse constrained optimization problems
Jiang Min et al.
NEUROCOMPUTING (2021)
A smoothing method for sparse optimization over convex sets
M. Haddou et al.
OPTIMIZATION LETTERS (2020)
Computation of second-order directional stationary points for group sparse optimization
Dingtao Peng et al.
OPTIMIZATION METHODS & SOFTWARE (2020)
Greedy Projected Gradient-Newton Method for Sparse Logistic Regression
Rui Wang et al.
IEEE TRANSACTIONS ON NEURAL NETWORKS AND LEARNING SYSTEMS (2020)
DC formulations and algorithms for sparse optimization problems
Jun-ya Gotoh et al.
MATHEMATICAL PROGRAMMING (2018)
Convergence of a Scholtes-type regularization method for cardinality-constrained optimization problems with an application in sparse robust portfolio optimization
Martin Branda et al.
COMPUTATIONAL OPTIMIZATION AND APPLICATIONS (2018)
Restricted Robinson Constraint Qualification and Optimality for Cardinality-Constrained Cone Programming
Lili Pan et al.
JOURNAL OF OPTIMIZATION THEORY AND APPLICATIONS (2017)
Optimality conditions for sparse nonlinear programming
LiLi Pan et al.
SCIENCE CHINA-MATHEMATICS (2017)
Surface approximation via sparse representation and parameterization optimization
Linlin Xu et al.
COMPUTER-AIDED DESIGN (2016)
New Improved Algorithms for Compressive Sensing Based on lp Norm
Jeevan K. Pant et al.
IEEE TRANSACTIONS ON CIRCUITS AND SYSTEMS II-EXPRESS BRIEFS (2014)
On the Equivalence Between a Minimal Codomain Cardinality Riesz Basis Construction, a System of Hadamard-Sylvester Operators, and a Class of Sparse, Binary Optimization Problems
James D. B. Nelson
IEEE TRANSACTIONS ON SIGNAL PROCESSING (2014)
SECOND-ORDER SMOOTHING OBJECTIVE PENALTY FUNCTION FOR CONSTRAINED OPTIMIZATION PROBLEMS
Min Jiang et al.
NUMERICAL FUNCTIONAL ANALYSIS AND OPTIMIZATION (2014)
A polynomial case of the cardinality-constrained quadratic optimization problem
Jianjun Gao et al.
JOURNAL OF GLOBAL OPTIMIZATION (2013)
SPARSITY CONSTRAINED NONLINEAR OPTIMIZATION: OPTIMALITY CONDITIONS AND ALGORITHMS
Amir Beck et al.
SIAM JOURNAL ON OPTIMIZATION (2013)
Equivalence of Minimal l0- and lp-Norm Solutions of Linear Equalities, Inequalities and Linear Programs for Sufficiently Small p
G. M. Fung et al.
JOURNAL OF OPTIMIZATION THEORY AND APPLICATIONS (2011)
On verifiable sufficient conditions for sparse signal recovery via l1 minimization
Anatoli Juditsky et al.
MATHEMATICAL PROGRAMMING (2011)
A Smoothing Objective Penalty Function Algorithm for Inequality Constrained Optimization Problems
Zhiqing Meng et al.
NUMERICAL FUNCTIONAL ANALYSIS AND OPTIMIZATION (2011)
LOWER BOUND THEORY OF NONZERO ENTRIES IN SOLUTIONS OF l(2)-l(p) MINIMIZATION
Xiaojun Chen et al.
SIAM JOURNAL ON SCIENTIFIC COMPUTING (2010)
Bregman Iterative Algorithms for $\ell_1$-Minimization with Applications to Compressed Sensing
Wotao Yin et al.
SIAM Journal on Imaging Sciences (2008)
Near-optimal signal recovery from random projections: Universal encoding strategies?
Emmanuel J. Candes et al.
IEEE TRANSACTIONS ON INFORMATION THEORY (2006)
On the smoothing of the square-root exact penalty function for inequality constrained optimization
Zhiqing Meng et al.
COMPUTATIONAL OPTIMIZATION AND APPLICATIONS (2006)
Decoding by linear programming
EJ Candes et al.
IEEE TRANSACTIONS ON INFORMATION THEORY (2005)
Smoothing nonlinear penalty functions for constrained optimization problems
XQ Yang et al.
NUMERICAL FUNCTIONAL ANALYSIS AND OPTIMIZATION (2003)
Share Paper
