Approximation accuracy, gradient methods, and error bound for structured convex optimization
From MaRDI portal
Publication:607498
DOI10.1007/s10107-010-0394-2zbMath1207.65084OpenAlexW2101868363MaRDI QIDQ607498
Publication date: 22 November 2010
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10107-010-0394-2
convex optimizationerror boundlinear convergenceregressionvariable selection\(\ell_{1}\)-regularizationcompressed sensingsensor network localizationproximal gradient methodapproximation accuracynuclear/trace norm
Related Items
A proximal gradient splitting method for solving convex vector optimization problems, Further properties of the forward-backward envelope with applications to difference-of-convex programming, An Accelerated Level-Set Method for Inverse Scattering Problems, Optimized first-order methods for smooth convex minimization, New results on subgradient methods for strongly convex optimization problems with a unified analysis, A simplified view of first order methods for optimization, Augmented Lagrangian methods for convex matrix optimization problems, When only global optimization matters, Block coordinate proximal gradient methods with variable Bregman functions for nonsmooth separable optimization, On globally Q-linear convergence of a splitting method for group Lasso, Unnamed Item, A First-Order Optimization Algorithm for Statistical Learning with Hierarchical Sparsity Structure, Convex optimization approach to signals with fast varying instantaneous frequency, A unified approach to error bounds for structured convex optimization problems, A unified penalized method for sparse additive quantile models: an RKHS approach, Bregman Proximal Point Algorithm Revisited: A New Inexact Version and Its Inertial Variant, An alternating direction method for finding Dantzig selectors, Computing proximal points of convex functions with inexact subgradients, A new convergence analysis and perturbation resilience of some accelerated proximal forward–backward algorithms with errors, Quadratic Growth Conditions for Convex Matrix Optimization Problems Associated with Spectral Functions, An extrapolated iteratively reweighted \(\ell_1\) method with complexity analysis, Proximal gradient methods for multiobjective optimization and their applications, Iteratively reweighted \(\ell _1\) algorithms with extrapolation, A simple convergence analysis of Bregman proximal gradient algorithm, Augmented Lagrangian method with alternating constraints for nonlinear optimization problems, Feature-aware regularization for sparse online learning, Smooth over-parameterized solvers for non-smooth structured optimization, Convergence rates of gradient methods for convex optimization in the space of measures, Linear Convergence of Proximal Gradient Algorithm with Extrapolation for a Class of Nonconvex Nonsmooth Minimization Problems, A singular value shrinkage thresholding algorithm for folded concave penalized low-rank matrix optimization problems, A globally convergent proximal Newton-type method in nonsmooth convex optimization, Convergence of an asynchronous block-coordinate forward-backward algorithm for convex composite optimization, The augmented Lagrangian method based on the APG strategy for an inverse damped gyroscopic eigenvalue problem, A modified proximal gradient method for a family of nonsmooth convex optimization problems, On the computational efficiency of subgradient methods: a case study with Lagrangian bounds, Proximal gradient method with extrapolation and line search for a class of non-convex and non-smooth problems, A very simple SQCQP method for a class of smooth convex constrained minimization problems with nice convergence results, On proximal gradient method for the convex problems regularized with the group reproducing kernel norm, Robust least square semidefinite programming with applications, Proximal methods for the latent group lasso penalty, On the linear convergence of a proximal gradient method for a class of nonsmooth convex minimization problems, Efficient random coordinate descent algorithms for large-scale structured nonconvex optimization, On the linear convergence of the approximate proximal splitting method for non-smooth convex optimization, A family of inexact SQA methods for non-smooth convex minimization with provable convergence guarantees based on the Luo-Tseng error bound property, Level-set methods for convex optimization, An alternating direction method of multipliers with the BFGS update for structured convex quadratic optimization, On the linear convergence of the alternating direction method of multipliers, Iteration complexity analysis of block coordinate descent methods, SOR- and Jacobi-type iterative methods for solving \(\ell_1 - \ell_2\) problems by way of Fenchel duality, On the convergence of the iterates of proximal gradient algorithm with extrapolation for convex nonsmooth minimization problems, Linear convergence of inexact descent method and inexact proximal gradient algorithms for lower-order regularization problems, On convex envelopes and regularization of non-convex functionals without moving global minima, A sequential partial linearization algorithm for the symmetric eigenvalue complementarity problem, Accelerated Residual Methods for the Iterative Solution of Systems of Equations, Calculus of the exponent of Kurdyka-Łojasiewicz inequality and its applications to linear convergence of first-order methods, A dual reformulation and solution framework for regularized convex clustering problems, Bounds for the tracking error of first-order online optimization methods, Faster subgradient methods for functions with Hölderian growth, Iteration complexity analysis of dual first-order methods for conic convex programming, Error Bounds, Quadratic Growth, and Linear Convergence of Proximal Methods, A Block Successive Upper-Bound Minimization Method of Multipliers for Linearly Constrained Convex Optimization, Linear Convergence of Descent Methods for the Unconstrained Minimization of Restricted Strongly Convex Functions, Iterative Proportional Scaling Revisited: A Modern Optimization Perspective, An accelerated smoothing gradient method for nonconvex nonsmooth minimization in image processing, The modified second APG method for DC optimization problems, A family of subgradient-based methods for convex optimization problems in a unifying framework, Variational analysis perspective on linear convergence of some first order methods for nonsmooth convex optimization problems, Adaptive FISTA for Nonconvex Optimization, Generalized Conditional Gradient for Sparse Estimation, Proximal-Like Incremental Aggregated Gradient Method with Linear Convergence Under Bregman Distance Growth Conditions, A telescopic Bregmanian proximal gradient method without the global Lipschitz continuity assumption, Some modified fast iterative shrinkage thresholding algorithms with a new adaptive non-monotone stepsize strategy for nonsmooth and convex minimization problems, Unnamed Item, Iteration Complexity of a Block Coordinate Gradient Descent Method for Convex Optimization, A control-theoretic perspective on optimal high-order optimization, Generalized affine scaling algorithms for linear programming problems, On Degenerate Doubly Nonnegative Projection Problems, An inexact accelerated stochastic ADMM for separable convex optimization, An inexact dual fast gradient-projection method for separable convex optimization with linear coupled constraints, Linear convergence of prox-SVRG method for separable non-smooth convex optimization problems under bounded metric subregularity, Perturbation techniques for convergence analysis of proximal gradient method and other first-order algorithms via variational analysis
Uses Software
Cites Work
- Algorithmic Aspects of Wireless Sensor Networks
- Excessive Gap Technique in Nonsmooth Convex Minimization
- A Linearly Convergent Dual-Based Gradient Projection Algorithm for Quadratically Constrained Convex Minimization
- SpaseLoc: An Adaptive Subproblem Algorithm for Scalable Wireless Sensor Network Localization
- Model Selection and Estimation in Regression with Grouped Variables
- A Convergent Incremental Gradient Method with a Constant Step Size
- Second‐Order Cone Programming Relaxation of Sensor Network Localization
- Bregman Iterative Algorithms for $\ell_1$-Minimization with Applications to Compressed Sensing
- Optimally sparse representation in general (nonorthogonal) dictionaries via ℓ 1 minimization
- Interior Gradient and Proximal Methods for Convex and Conic Optimization
- Second-order Cone Programming Methods for Total Variation-Based Image Restoration
- For most large underdetermined systems of linear equations the minimal 𝓁1‐norm solution is also the sparsest solution
- On the Statistical Analysis of Smoothing by Maximizing Dirty Markov Random Field Posterior Distributions
- Stable signal recovery from incomplete and inaccurate measurements
- Convex Analysis
- An Iterative Regularization Method for Total Variation-Based Image Restoration
- Convergence of a block coordinate descent method for nondifferentiable minimization
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Primal-dual subgradient methods for convex problems
- Smooth minimization of non-smooth functions
- Sparse inverse covariance estimation with the graphical lasso
- A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
- Sensor network localization, Euclidean distance matrix completions, and graph realization
- Fixed point and Bregman iterative methods for matrix rank minimization
- Duality-based algorithms for total-variation-regularized image restoration
- Primal-dual first-order methods with \({\mathcal {O}(1/\varepsilon)}\) iteration-complexity for cone programming
- (Robust) edge-based semidefinite programming relaxation of sensor network localization
- Convex optimization methods for dimension reduction and coefficient estimation in multivariate linear regression
- A coordinate gradient descent method for linearly constrained smooth optimization and support vector machines training
- Sum of squares method for sensor network localization
- Theory of semidefinite programming for sensor network localization
- Smoothing technique and its applications in semidefinite optimization
- The restricted isometry property and its implications for compressed sensing
- A coordinate gradient descent method for nonsmooth separable minimization
- Convex multi-task feature learning
- Block-coordinate gradient descent method for linearly constrained nonsmooth separable optimization
- A simple proof of the restricted isometry property for random matrices
- Sparsity-preserving SOR algorithms for separable quadratic and linear programming
- Incremental gradient algorithms with stepsizes bounded away from zero
- Error bounds and convergence analysis of feasible descent methods: A general approach
- Grassmannian frames with applications to coding and communication
- Introductory lectures on convex optimization. A basic course.
- Parallel variable distribution for constrained optimization
- Mirror descent and nonlinear projected subgradient methods for convex optimization.
- Graph rigidity via Euclidean distance matrices
- Dual coordinate ascent methods for non-strictly convex minimization
- Pathwise coordinate optimization
- On linear-time algorithms for the continuous quadratic Knapsack problem
- Interior projection-like methods for monotone variational inequalities
- A Singular Value Thresholding Algorithm for Matrix Completion
- NESTA: A Fast and Accurate First-Order Method for Sparse Recovery
- Adapting to Unknown Smoothness via Wavelet Shrinkage
- Convergence Analysis of a Proximal-Like Minimization Algorithm Using Bregman Functions
- A New Alternating Minimization Algorithm for Total Variation Image Reconstruction
- Model selection and estimation in the Gaussian graphical model
- On Sparse Representations in Arbitrary Redundant Bases
- Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information
- Decoding by Linear Programming
- Stable recovery of sparse overcomplete representations in the presence of noise
- Recovery of Exact Sparse Representations in the Presence of Bounded Noise
- Sparse representations in unions of bases
- Greed is Good: Algorithmic Results for Sparse Approximation
- Just relax: convex programming methods for identifying sparse signals in noise
- Signal Recovery From Random Measurements Via Orthogonal Matching Pursuit
- An Efficient TVL1 Algorithm for Deblurring Multichannel Images Corrupted by Impulsive Noise
- Interior-Point Method for Nuclear Norm Approximation with Application to System Identification
- Guaranteed Minimum-Rank Solutions of Linear Matrix Equations via Nuclear Norm Minimization
- First-Order Methods for Sparse Covariance Selection
- Further Relaxations of the Semidefinite Programming Approach to Sensor Network Localization
- A Distributed SDP Approach for Large-Scale Noisy Anchor-Free Graph Realization with Applications to Molecular Conformation
- The Group Lasso for Logistic Regression
- Robust Stochastic Approximation Approach to Stochastic Programming
- A Maxmin Location Problem
- A generalized proximal point algorithm for certain non-convex minimization problems
- On the Linear Convergence of Descent Methods for Convex Essentially Smooth Minimization
- Parallel Variable Transformation in Unconstrained Optimization
- Atomic Decomposition by Basis Pursuit
- Numerical Optimization
- Mathematical Programming in Neural Networks
- On the Convergence Rate of Dual Ascent Methods for Linearly Constrained Convex Minimization
- Heuristic and Special Case Algorithms for Dispersion Problems
- Ideal spatial adaptation by wavelet shrinkage
- Parallel Variable Distribution
- 10.1162/15324430152748218
- Convergence of Proximal-Like Algorithms
- Proximal Minimization Methods with Generalized Bregman Functions
- An Incremental Gradient(-Projection) Method with Momentum Term and Adaptive Stepsize Rule
- Bregman Monotone Optimization Algorithms
- Uncertainty principles and ideal atomic decomposition
- Identification of Matrices Having a Sparse Representation
- Sparse Reconstruction by Separable Approximation
- An iterative thresholding algorithm for linear inverse problems with a sparsity constraint
- Convergence of Approximate and Incremental Subgradient Methods for Convex Optimization
- Prox-Method with Rate of Convergence O(1/t) for Variational Inequalities with Lipschitz Continuous Monotone Operators and Smooth Convex-Concave Saddle Point Problems
- Nonlinear Proximal Point Algorithms Using Bregman Functions, with Applications to Convex Programming
- Finite-Dimensional Variational Inequalities and Complementarity Problems
- Parallel Gradient Distribution in Unconstrained Optimization
- Matching pursuits with time-frequency dictionaries
- Further Results on Stable Recovery of Sparse Overcomplete Representations in the Presence of Noise
- Exploiting Sparsity in SDP Relaxation for Sensor Network Localization
- Sparse Solution of Underdetermined Systems of Linear Equations by Stagewise Orthogonal Matching Pursuit