A first order method for finding minimal norm-like solutions of convex optimization problems
DOI10.1007/S10107-013-0708-2zbMATH Open1297.90079OpenAlexW2129704204MaRDI QIDQ463716FDOQ463716
Authors: Shoham Sabach, Amir Beck 
Publication date: 17 October 2014
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.416.847
Recommendations
- An optimal randomized incremental gradient method
- Three-step method of gradient projection for minimization problems
- Nearly optimal first-order methods for convex optimization under gradient norm measure: an adaptive regularization approach
- An optimal gradient method for smooth strongly convex minimization
- Regularized gradient-projection methods for finding the minimum-norm solution of the constrained convex minimization problem
Numerical mathematical programming methods (65K05) Convex programming (90C25) Linear programming (90C05) Nonlinear programming (90C30) Ill-posedness and regularization problems in numerical linear algebra (65F22)
Cites Work
- Regularization tools: A Matlab package for analysis and solution of discrete ill-posed problems
- Generalized Cross-Validation as a Method for Choosing a Good Ridge Parameter
- Introductory lectures on convex optimization. A basic course.
- Title not available (Why is that?)
- The Use of the L-Curve in the Regularization of Discrete Ill-Posed Problems
- Lectures on modern convex optimization. Analysis, algorithms, and engineering applications
- A Technique for the Numerical Solution of Certain Integral Equations of the First Kind
- Title not available (Why is that?)
- Title not available (Why is that?)
- Convergence Analysis of a Proximal-Like Minimization Algorithm Using Bregman Functions
- Bilevel programming: a survey
- On the minimum norm solution of linear programs
- Exact Regularization of Convex Programs
- Nonlinear Perturbation of Linear Programs
- Title not available (Why is that?)
- Finite perturbation of convex programs
Cited In (18)
- A first-order method for solving bilevel convex optimization problems in Banach space
- First-Order Methods for Nonconvex Quadratic Minimization
- A novel algorithm for convex bi-level optimization problems in Hilbert spaces with applications
- Revisiting linearized Bregman iterations under Lipschitz-like convexity condition
- A first order method for solving convex bilevel optimization problems
- Methodology and first-order algorithms for solving nonsmooth and non-strongly convex bilevel optimization problems
- An explicit Tikhonov algorithm for nested variational inequalities
- A dual method for minimizing a nonsmooth objective over one smooth inequality constraint
- The forward-backward splitting method for finding the minimum like-norm solution of the mixed variational inequality problem
- A method with convergence rates for optimization problems with variational inequality constraints
- Algorithms for simple bilevel programming
- Alternated and multi-step inertial approximation methods for solving convex bilevel optimization problems
- Bilevel optimization: theory, algorithms, applications and a bibliography
- An online convex optimization-based framework for convex bilevel optimization
- Convex Bi-level Optimization Problems with Nonsmooth Outer Objective Function
- Iterative regularization via dual diagonal descent
- New computational guarantees for solving convex optimization problems with first order methods, via a function growth condition measure
- An inertial extrapolation method for convex simple bilevel optimization
Uses Software
This page was built for publication: A first order method for finding minimal norm-like solutions of convex optimization problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q463716)
