A first order method for finding minimal norm-like solutions of convex optimization problems

DOI10.1007/s10107-013-0708-2zbMath1297.90079OpenAlexW2129704204MaRDI QIDQ463716

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

zbMATH Keywords

complexity analysisconvex minimizationbilevel optimizationminimal norm solution

Mathematics Subject Classification ID

Ill-posedness and regularization problems in numerical linear algebra (65F22) Numerical mathematical programming methods (65K05) Convex programming (90C25) Nonlinear programming (90C30) Linear programming (90C05)

Related Items

A dual method for minimizing a nonsmooth objective over one smooth inequality constraint, Revisiting linearized Bregman iterations under Lipschitz-like convexity condition, Convex Bi-level Optimization Problems with Nonsmooth Outer Objective Function, Alternated and multi-step inertial approximation methods for solving convex bilevel optimization problems, Methodology and first-order algorithms for solving nonsmooth and non-strongly convex bilevel optimization problems, The forward-backward splitting method for finding the minimum like-norm solution of the mixed variational inequality problem, An online convex optimization-based framework for convex bilevel optimization, Iterative regularization via dual diagonal descent, Unnamed Item, A Method with Convergence Rates for Optimization Problems with Variational Inequality Constraints, A First Order Method for Solving Convex Bilevel Optimization Problems, An explicit Tikhonov algorithm for nested variational inequalities, An inertial extrapolation method for convex simple bilevel optimization, Algorithms for Simple Bilevel Programming, Bilevel Optimization: Theory, Algorithms, Applications and a Bibliography

Uses Software

• Regularization tools

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Finite perturbation of convex programs
• Bilevel programming: a survey
• Regularization tools: A Matlab package for analysis and solution of discrete ill-posed problems
• On the minimum norm solution of linear programs
• Introductory lectures on convex optimization. A basic course.
• Lectures on Modern Convex Optimization
• Convergence Analysis of a Proximal-Like Minimization Algorithm Using Bregman Functions
• Exact Regularization of Convex Programs
• A Technique for the Numerical Solution of Certain Integral Equations of the First Kind
• Nonlinear Perturbation of Linear Programs
• Generalized Cross-Validation as a Method for Choosing a Good Ridge Parameter
• The Use of the L-Curve in the Regularization of Discrete Ill-Posed Problems