An infeasible-point subgradient method using adaptive approximate projections
From MaRDI portal
Publication:461434
DOI10.1007/s10589-013-9602-3zbMath1304.90159arXiv1104.5351OpenAlexW2157749841MaRDI QIDQ461434
Marc E. Pfetsch, Andreas M. Tillmann, Dirk A. Lorenz
Publication date: 10 October 2014
Published in: Computational Optimization and Applications (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1104.5351
nonsmooth optimizationconvex optimizationcompressed sensingprojected subgradient methodapproximate projection
Related Items
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Smooth minimization of non-smooth functions
- Computing and analyzing recoverable supports for sparse reconstruction
- Local linear convergence for alternating and averaged nonconvex projections
- Convergence and computational analyses for some variable target value and subgradient deflection methods
- Integrated chance constraints: reduced forms and an algorithm
- Proximity control in bundle methods for convex nondifferentiable minimization
- Two ``well-known properties of subgradient optimization
- Convergent bounds for stochastic programs with expected value constraints
- Duality in stochastic linear and dynamic programming
- On the choice of step size in subgradient optimization
- Variable target value subgradient method
- Conditional subgradient optimization -- theory and applications
- On the projected subgradient method for nonsmooth convex optimization in a Hilbert space
- Convergence of a simple subgradient level method
- Subgradient method with entropic projections for convex nondifferentiable minimization
- Stochastic linear programming. Models, theory, and computation
- Adaptive wavelet methods. II: Beyond the elliptic case
- The effect of deterministic noise in subgradient methods
- A variable target value method for nondifferentiable optimization
- Chance-Constrained Programming
- Vehicle Scheduling in Public Transit and Lagrangean Pricing
- Incremental Subgradient Methods for Nondifferentiable Optimization
- Necessary and sufficient conditions for linear convergence of ℓ1-regularization
- Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information
- Incremental Subgradients for Constrained Convex Optimization: A Unified Framework and New Methods
- The Projected Subgradient Method for Nonsmooth Convex Optimization in the Presence of Computational Errors
- From Sparse Solutions of Systems of Equations to Sparse Modeling of Signals and Images
- Cutting-set methods for robust convex optimization with pessimizing oracles
- A generalization of Polyak's convergence result for subgradient optimization
- Atomic Decomposition by Basis Pursuit
- A new approach to variable selection in least squares problems
- Sparse Reconstruction by Separable Approximation
- Convergence of Approximate and Incremental Subgradient Methods for Convex Optimization
- On Projection Algorithms for Solving Convex Feasibility Problems
- Contributions to the theory of stochastic programming
- Convergence Analysis of Deflected Conditional Approximate Subgradient Methods
- Solving Basis Pursuit
- Minimization of unsmooth functionals
- A Descent Numerical Method for Optimization Problems with Nondifferentiable Cost Functionals
- Methods of conjugate gradients for solving linear systems
- Compressed sensing
