Restricted normal cones and sparsity optimization with affine constraints
From MaRDI portal
Publication:404252
DOI10.1007/s10208-013-9161-0zbMath1298.49047arXiv1205.0320OpenAlexW2107479212MaRDI QIDQ404252
D. Russell Luke, Hung M. Phan, Heinz H. Bauschke, Shawn Xianfu Wang
Publication date: 4 September 2014
Published in: Foundations of Computational Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1205.0320
Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) Nonsmooth analysis (49J52) Numerical methods of relaxation type (49M20)
Related Items
Optimality conditions for sparse nonlinear programming ⋮ Sparsity constrained optimization problems via disjunctive programming ⋮ Malitsky-Tam forward-reflected-backward splitting method for nonconvex minimization problems ⋮ Regularity properties of non-negative sparsity sets ⋮ Restricted normal cones and the method of alternating projections: applications ⋮ Restricted normal cones and the method of alternating projections: theory ⋮ Restricted Robinson constraint qualification and optimality for cardinality-constrained cone programming ⋮ An augmented Lagrangian method for optimization problems with structured geometric constraints ⋮ Solution sets of three sparse optimization problems for multivariate regression ⋮ Inertial Proximal Block Coordinate Method for a Class of Nonsmooth Sum-of-Ratios Optimization Problems ⋮ Recent results on Douglas-Rachford methods for combinatorial optimization problems ⋮ A quadratic penalty method for hypergraph matching ⋮ Prox-regularity of rank constraint sets and implications for algorithms ⋮ Orbital geometry and group majorisation in optimisation ⋮ Duality and Convex Programming ⋮ Kurdyka-Łojasiewicz property of zero-norm composite functions ⋮ A convergent relaxation of the Douglas-Rachford algorithm ⋮ Algorithms based on unions of nonexpansive maps ⋮ Quantitative Convergence Analysis of Iterated Expansive, Set-Valued Mappings ⋮ Optimization on Spheres: Models and Proximal Algorithms with Computational Performance Comparisons ⋮ Phase Retrieval with Sparse Phase Constraint ⋮ On solutions of sparsity constrained optimization ⋮ The first-order necessary conditions for sparsity constrained optimization
Cites Work
- Unnamed Item
- Restricted normal cones and the method of alternating projections: applications
- Restricted normal cones and the method of alternating projections: theory
- Local linear convergence of approximate projections onto regularized sets
- Reflection-projection method for convex feasibility problems with an obtuse cone
- Local linear convergence for alternating and averaged nonconvex projections
- Method of successive projections for finding a common point of sets in metric spaces
- Techniques of variational analysis
- A Linearly Convergent Algorithm for Solving a Class of Nonconvex/Affine Feasibility Problems
- Entropic Regularization of the ℓ 0 Function
- An Unconstrained $\ell_q$ Minimization with $0q\leq1$ for Sparse Solution of Underdetermined Linear Systems
- Proximal Alternating Minimization and Projection Methods for Nonconvex Problems: An Approach Based on the Kurdyka-Łojasiewicz Inequality
- Implicit Functions and Solution Mappings
- Near-Optimal Signal Recovery From Random Projections: Universal Encoding Strategies?
- From Sparse Solutions of Systems of Equations to Sparse Modeling of Signals and Images
- Sparse Approximate Solutions to Linear Systems
- Alternating Projections on Manifolds
- Optimally sparse representation in general (nonorthogonal) dictionaries via ℓ 1 minimization
- Convex Analysis
- Theory of Reproducing Kernels
- Convex analysis and monotone operator theory in Hilbert spaces
- Best approximation in inner product spaces
