A first order method for finding minimal norm-like solutions of convex optimization problems
From MaRDI portal
(Redirected from Publication:463716)
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
Cites work
- scientific article; zbMATH DE number 1818892 (Why is no real title available?)
- scientific article; zbMATH DE number 3711742 (Why is no real title available?)
- scientific article; zbMATH DE number 3790208 (Why is no real title available?)
- scientific article; zbMATH DE number 3551792 (Why is no real title available?)
- A Technique for the Numerical Solution of Certain Integral Equations of the First Kind
- Bilevel programming: a survey
- Convergence Analysis of a Proximal-Like Minimization Algorithm Using Bregman Functions
- Exact Regularization of Convex Programs
- Finite perturbation of convex programs
- Generalized Cross-Validation as a Method for Choosing a Good Ridge Parameter
- Introductory lectures on convex optimization. A basic course.
- Lectures on modern convex optimization. Analysis, algorithms, and engineering applications
- Nonlinear Perturbation of Linear Programs
- On the minimum norm solution of linear programs
- Regularization tools: A Matlab package for analysis and solution of discrete ill-posed problems
- The Use of the L-Curve in the Regularization of Discrete Ill-Posed Problems
Cited in
(18)- An inertial extrapolation method for convex simple bilevel optimization
- A first-order method for solving bilevel convex optimization problems in Banach space
- First-Order Methods for Nonconvex Quadratic Minimization
- Revisiting linearized Bregman iterations under Lipschitz-like convexity condition
- A novel algorithm for convex bi-level optimization problems in Hilbert spaces with applications
- 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
- Algorithms for simple bilevel programming
- A method with convergence rates for optimization problems with variational inequality constraints
- Alternated and multi-step inertial approximation methods for solving convex bilevel optimization problems
- An online convex optimization-based framework for convex bilevel optimization
- Bilevel optimization: theory, algorithms, applications and a bibliography
- Iterative regularization via dual diagonal descent
- Convex Bi-level Optimization Problems with Nonsmooth Outer Objective Function
- New computational guarantees for solving convex optimization problems with first order methods, via a function growth condition measure
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)
