Exact Regularization of Convex Programs
From MaRDI portal
Publication:3544264
DOI10.1137/060675320zbMath1176.90457OpenAlexW2092554297MaRDI QIDQ3544264
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
Convex programming (90C25) Numerical optimization and variational techniques (65K10) Linear programming (90C05) Interior-point methods (90C51) Duality theory (optimization) (49N15)
Related Items
Linear programming with nonparametric penalty programs and iterated thresholding, Sparse Approximations with Interior Point Methods, Local Linear Convergence of the ADMM/Douglas--Rachford Algorithms without Strong Convexity and Application to Statistical Imaging, Local linear convergence of a primal-dual algorithm for the augmented convex models, Accelerated Bregman method for linearly constrained \(\ell _1-\ell _2\) minimization, The modified accelerated Bregman method for regularized basis pursuit problem, A primal-dual algorithm for unfolding neutron energy spectrum from multiple activation foils, Inexact accelerated augmented Lagrangian methods, Dynamic non-diagonal regularization in interior point methods for linear and convex quadratic programming, An interior point method for nonlinear optimization with a quasi-tangential subproblem, Exact Regularization, and Its Connections to Normal Cone Identity and Weak Sharp Minima in Nonlinear Programming, On Stochastic and Deterministic Quasi-Newton Methods for Nonstrongly Convex Optimization: Asymptotic Convergence and Rate Analysis, Faster randomized block sparse Kaczmarz by averaging, Non-crossing convex quantile regression, An exact penalty approach for optimization with nonnegative orthogonality constraints, Error forgetting of Bregman iteration, Accelerated linearized Bregman method, Matrix-free interior point method, Regularization of vector equilibrium problems, Constructing New Weighted ℓ1-Algorithms for the Sparsest Points of Polyhedral Sets, Lagrangian-penalization algorithm for constrained optimization and variational inequalities, A first order method for finding minimal norm-like solutions of convex optimization problems, Lagrange multipliers, (exact) regularization and error bounds for monotone variational inequalities, Templates for convex cone problems with applications to sparse signal recovery, A primal-dual regularized interior-point method for convex quadratic programs, From simple structure to sparse components: a review, Penalty Methods for a Class of Non-Lipschitz Optimization Problems, Lagrangian duality and saddle points for sparse linear programming, The Tikhonov regularization for vector equilibrium problems, Parameter estimation with expected and residual-at-risk criteria, Block-coordinate gradient descent method for linearly constrained nonsmooth separable optimization, On the Convergence of Decentralized Gradient Descent, A time continuation based fast approximate algorithm for compressed sensing related optimization, Duality gap estimates for weak Chebyshev greedy algorithms in Banach spaces, An $L^1$ Penalty Method for General Obstacle Problems, On a primal-dual Newton proximal method for convex quadratic programs
Uses Software
