Greedy approximation in convex optimization
From MaRDI portal
Publication:2343051
DOI10.1007/s00365-014-9272-0zbMath1317.41016arXiv1206.0392OpenAlexW1970524360MaRDI QIDQ2343051
Publication date: 4 May 2015
Published in: Constructive Approximation (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1206.0392
Numerical mathematical programming methods (65K05) Geometry and structure of normed linear spaces (46B20) Abstract approximation theory (approximation in normed linear spaces and other abstract spaces) (41A65) Approximation by arbitrary nonlinear expressions; widths and entropy (41A46)
Related Items
Greedy strategies for convex optimization, Toward Efficient Ensemble Learning with Structure Constraints: Convergent Algorithms and Applications, Biorthogonal greedy algorithms in convex optimization, Convergence and rate of convergence of some greedy algorithms in convex optimization, Greedy Variable Selection for High-Dimensional Cox Models, Rescaled pure greedy algorithm for convex optimization, Model selection for high-dimensional linear regression with dependent observations, Greedy expansions in convex optimization, On the Convergence of a Greedy Algorithm for the Solution of the Problem for the Construction of Monotone Regression, Dictionary descent in optimization, Schwarz iterative methods: infinite space splittings, Duality gap estimates for weak Chebyshev greedy algorithms in Banach spaces, Duality gap estimates for a class of greedy optimization algorithms in Banach spaces
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Convex optimization on Banach spaces
- Greedy expansions in convex optimization
- Iterative hard thresholding for compressed sensing
- Convex analysis and nonlinear optimization. Theory and examples.
- Relaxation in greedy approximation
- CoSaMP: Iterative signal recovery from incomplete and inaccurate samples
- Uniform uncertainty principle and signal recovery via regularized orthogonal matching pursuit
- A simple lemma on greedy approximation in Hilbert space and convergence rates for projection pursuit regression and neural network training
- Conditional gradient algorithms with open loop step size rules
- Introductory lectures on convex optimization. A basic course.
- Greedy-type approximation in Banach spaces and applications
- The convex geometry of linear inverse problems
- Weak greedy algorithms
- Greedy strategies for convex optimization
- Coordinate and subspace optimization methods for linear least squares with non-quadratic regularization
- Sparsity Constrained Nonlinear Optimization: Optimality Conditions and Algorithms
- SPARSE APPROXIMATION AND RECOVERY BY GREEDY ALGORITHMS IN BANACH SPACES
- Coresets, sparse greedy approximation, and the Frank-Wolfe algorithm
- Sparse Approximation and Recovery by Greedy Algorithms
- Compressed Sensing With Nonlinear Observations and Related Nonlinear Optimization Problems
- Trading Accuracy for Sparsity in Optimization Problems with Sparsity Constraints
- Greedy Approximation
- Greedy approximation
- Uniformly convex functions on Banach spaces
- Universal approximation bounds for superpositions of a sigmoidal function
- Gradient Pursuits
- Stagewise Weak Gradient Pursuits
- Sequential greedy approximation for certain convex optimization problems
- Subspace Pursuit for Compressive Sensing Signal Reconstruction
- Sparse Recovery With Orthogonal Matching Pursuit Under RIP
- Adaptive Forward-Backward Greedy Algorithm for Learning Sparse Representations
- Greedy Sparsity-Constrained Optimization
- Greedy algorithms in Banach spaces
