A smoothing SQP framework for a class of composite \(L_q\) minimization over polyhedron
From MaRDI portal
Publication:304258
DOI10.1007/s10107-015-0939-5zbMath1346.90684arXiv1407.7205OpenAlexW1577667013MaRDI QIDQ304258
Ya-Feng Liu, Yu-Hong Dai, Shi-Qian Ma, Shu-Zhong Zhang
Publication date: 25 August 2016
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1407.7205
optimality conditionsmoothing approximation\(\epsilon \)-KKT pointcomposite \(L_q\) minimizationnonsmooth nonconvex non-Lipschitzian optimizationworst-case iteration complexity
Numerical mathematical programming methods (65K05) Nonconvex programming, global optimization (90C26) Nonlinear programming (90C30) Optimality conditions and duality in mathematical programming (90C46)
Related Items
Smoothing projected Barzilai-Borwein method for constrained non-Lipschitz optimization, A Smoothing Direct Search Method for Monte Carlo-Based Bound Constrained Composite Nonsmooth Optimization, An interior stochastic gradient method for a class of non-Lipschitz optimization problems, Necessary optimality conditions and exact penalization for non-Lipschitz nonlinear programs, An improved algorithm for the \(L_2-L_p\) minimization problem, A generalized elastic net regularization with smoothed \(\ell _{q}\) penalty for sparse vector recovery, An Augmented Lagrangian Method for Non-Lipschitz Nonconvex Programming, Smoothing accelerated proximal gradient method with fast convergence rate for nonsmooth convex optimization beyond differentiability, An extrapolated proximal iteratively reweighted method for nonconvex composite optimization problems, Mathematical programs with complementarity constraints and a non-Lipschitz objective: optimality and approximation, On constrained optimization with nonconvex regularization, Complexity of Partially Separable Convexly Constrained Optimization with Non-Lipschitzian Singularities, Structured nonconvex and nonsmooth optimization: algorithms and iteration complexity analysis, A gradient descent based algorithm for \(\ell_p\) minimization, A Smoothing Active Set Method for Linearly Constrained Non-Lipschitz Nonconvex Optimization, $L_p$-norm Regularization Algorithms for Optimization Over Permutation Matrices, Sparse Solutions by a Quadratically Constrained ℓq (0 <q< 1) Minimization Model, Optimality condition and complexity analysis for linearly-constrained optimization without differentiability on the boundary
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Smooth minimization of non-smooth functions
- A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
- Accelerated gradient methods for nonconvex nonlinear and stochastic programming
- A mathematical introduction to compressive sensing
- Recovery of sparsest signals via \(\ell^q \)-minimization
- Iterative reweighted minimization methods for \(l_p\) regularized unconstrained nonlinear programming
- Adaptive cubic regularisation methods for unconstrained optimization. I: Motivation, convergence and numerical results
- A coordinate gradient descent method for \(\ell_{1}\)-regularized convex minimization
- A note on the complexity of \(L _{p }\) minimization
- Adaptive cubic regularisation methods for unconstrained optimization. II: Worst-case function- and derivative-evaluation complexity
- Smoothing methods for nonsmooth, nonconvex minimization
- Enhancing sparsity by reweighted \(\ell _{1}\) minimization
- A framework of constraint preserving update schemes for optimization on Stiefel manifold
- Sparsest solutions of underdetermined linear systems via \( \ell _q\)-minimization for \(0<q\leqslant 1\)
- Large-scale linear programming techniques for the design of protein folding potentials
- Preprocessing for quadratic programming
- Support-vector networks
- Complexity of unconstrained \(L_2 - L_p\) minimization
- Recursive approximation of the high dimensional max function
- Optimization theory and methods. Nonlinear programming
- Complexity analysis of interior point algorithms for non-Lipschitz and nonconvex minimization
- An affine scaling methodology for best basis selection
- Lectures on Modern Convex Optimization
- R-linear convergence of the Barzilai and Borwein gradient method
- Improved Iteratively Reweighted Least Squares for Unconstrained Smoothed $\ell_q$ Minimization
- Smoothing and worst-case complexity for direct-search methods in nonsmooth optimization
- Optimality Conditions and a Smoothing Trust Region Newton Method for NonLipschitz Optimization
- Worst-Case Complexity of Smoothing Quadratic Regularization Methods for Non-Lipschitzian Optimization
- An Unconstrained $\ell_q$ Minimization with $0q\leq1$ for Sparse Solution of Underdetermined Linear Systems
- Lower Bound Theory of Nonzero Entries in Solutions of $\ell_2$-$\ell_p$ Minimization
- Smoothing Nonlinear Conjugate Gradient Method for Image Restoration Using Nonsmooth Nonconvex Minimization
- Fixed-Point Continuation Applied to Compressed Sensing: Implementation and Numerical Experiments
- On the Evaluation Complexity of Composite Function Minimization with Applications to Nonconvex Nonlinear Programming
- Restricted isometry properties and nonconvex compressive sensing
- Decoding by Linear Programming
- Probing the Pareto Frontier for Basis Pursuit Solutions
- From Sparse Solutions of Systems of Equations to Sparse Modeling of Signals and Images
- A group bridge approach for variable selection
- Iteratively reweighted least squares minimization for sparse recovery
- Optimization and nonsmooth analysis
- Two-Point Step Size Gradient Methods
- Variable Selection via Nonconcave Penalized Likelihood and its Oracle Properties
- Nonmonotone Spectral Projected Gradient Methods on Convex Sets
- Sparse Reconstruction by Separable Approximation
- Minimizing Nonconvex Functions for Sparse Vector Reconstruction
- Joint Power and Admission Control via Linear Programming Deflation
- Joint Power and Admission Control: Non-Convex <formula formulatype="inline"><tex Notation="TeX">$L_{q}$</tex></formula> Approximation and An Effective Polynomial Time Deflation Approach
- Non-Lipschitz $\ell_{p}$-Regularization and Box Constrained Model for Image Restoration
- Efficient Reconstruction of Piecewise Constant Images Using Nonsmooth Nonconvex Minimization
