Exact Regularization of Convex Programs
From MaRDI portal
Publication:3544264
DOI10.1137/060675320zbMATH Open1176.90457OpenAlexW2092554297MaRDI QIDQ3544264FDOQ3544264
Authors: Michael P. Friedlander, Paul Tseng 
Publication date: 5 December 2008
Published in: SIAM Journal on Optimization (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/7bc6ed12dc135f2a5a7f2587110cba55e81d5e70
Recommendations
- On the application of the regularization method for the correction of improper problems of convex programming
- On a mathematical programming problem with approximately specified information
- scientific article
- Publication:3200897
- Publication:3468887
- Solution of ill-posed nonconvex optimization problems with accuracy proportional to the error in input data
- On the parameter control of the residual method for the correction of improper problems of convex programming
- New characterizations of exact regularization of non-convex programs
- A saddle point characterization of exact regularization of non-convex programs
- Regularization for unconstrained vector optimization of functionals in Banach spaces
Numerical optimization and variational techniques (65K10) Convex programming (90C25) Linear programming (90C05) Interior-point methods (90C51) Duality theory (optimization) (49N15)
Cited In (48)
- Inexact accelerated augmented Lagrangian methods
- From simple structure to sparse components: a review
- Exact regularization of polyhedral norms
- Penalty Methods for a Class of Non-Lipschitz Optimization Problems
- Title not available (Why is that?)
- The modified accelerated Bregman method for regularized basis pursuit problem
- An efficient sieving-based secant method for sparse optimization problems with least-squares constraints
- Faster randomized block sparse Kaczmarz by averaging
- Exact penalization for cardinality and rank-constrained optimization problems via partial regularization
- On Stochastic and Deterministic Quasi-Newton Methods for Nonstrongly Convex Optimization: Asymptotic Convergence and Rate Analysis
- Accelerated linearized Bregman method
- Cardinality-constrained structured data-fitting problems
- Block-coordinate gradient descent method for linearly constrained nonsmooth separable optimization
- Cardinality minimization, constraints, and regularization: a survey
- Lagrangian duality and saddle points for sparse linear programming
- Title not available (Why is that?)
- A choice of the regularization parameter in solving convex extremal problems
- AN EXPONENTIAL LOWER BOUND ON THE COMPLEXITY OF REGULARIZATION PATHS
- An exact penalty approach for optimization with nonnegative orthogonality constraints
- The Tikhonov regularization for vector equilibrium problems
- A saddle point characterization of exact regularization of non-convex programs
- Parameter estimation with expected and residual-at-risk criteria
- Dynamic non-diagonal regularization in interior point methods for linear and convex quadratic programming
- Linear programming with nonparametric penalty programs and iterated thresholding
- Matrix-free interior point method
- Lagrangian-penalization algorithm for constrained optimization and variational inequalities
- A first order method for finding minimal norm-like solutions of convex optimization problems
- Constructing New Weighted ℓ1-Algorithms for the Sparsest Points of Polyhedral Sets
- A primal-dual regularized interior-point method for convex quadratic programs
- A time continuation based fast approximate algorithm for compressed sensing related optimization
- A primal-dual algorithm for unfolding neutron energy spectrum from multiple activation foils
- On the convergence of decentralized gradient descent
- New characterizations of exact regularization of non-convex programs
- Exact Regularization, and Its Connections to Normal Cone Identity and Weak Sharp Minima in Nonlinear Programming
- Local linear convergence of a primal-dual algorithm for the augmented convex models
- An interior point method for nonlinear optimization with a quasi-tangential subproblem
- Error forgetting of Bregman iteration
- Duality gap estimates for weak Chebyshev greedy algorithms in Banach spaces
- An $L^1$ Penalty Method for General Obstacle Problems
- Accelerated Bregman method for linearly constrained \(\ell _1-\ell _2\) minimization
- Regularization of vector equilibrium problems
- Local Linear Convergence of the ADMM/Douglas--Rachford Algorithms without Strong Convexity and Application to Statistical Imaging
- On the regularization method for conflicting problems of convex programming
- Lagrange multipliers, (exact) regularization and error bounds for monotone variational inequalities
- Non-crossing convex quantile regression
- Templates for convex cone problems with applications to sparse signal recovery
- On a primal-dual Newton proximal method for convex quadratic programs
- Sparse Approximations with Interior Point Methods
Uses Software
This page was built for publication: Exact Regularization of Convex Programs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3544264)
