On perturbed steepest descent methods with inexact line search for bilevel convex optimization
From MaRDI portal
Publication:3112499
Recommendations
- Alternated and multi-step inertial approximation methods for solving convex bilevel optimization problems
- scientific article; zbMATH DE number 5176444
- Perturbed steepest-descent technique in multiextremal problems
- An alternating linearization method with inexact data for bilevel nonsmooth convex optimization
- On bilevel optimization with inexact follower
- Full convergence of the steepest descent method with inexact line searches
- scientific article; zbMATH DE number 6541941
- \(\epsilon\)-subgradient algorithms for bilevel convex optimization
- Descent methods with linesearch in the presence of perturbations
- Linesearch methods for bilevel split pseudomonotone variational inequality problems
Cites work
- scientific article; zbMATH DE number 1266748 (Why is no real title available?)
- A Convergent Incremental Gradient Method with a Constant Step Size
- A New Class of Incremental Gradient Methods for Least Squares Problems
- A Simultaneous Iterative Method for Computing Projections on Polyhedra
- A Statistical Model for Positron Emission Tomography
- A relaxed version of Bregman's method for convex programming
- A simultaneous projections method for linear inequalities
- An Incremental Gradient(-Projection) Method with Momentum Term and Adaptive Stepsize Rule
- An overview of bilevel optimization
- Compressed sensing
- Convergence of Approximate and Incremental Subgradient Methods for Convex Optimization
- Convergence results for scaled gradient algorithms in positron emission tomography
- Decoding by Linear Programming
- Error stability properties of generalized gradient-type algorithms
- For most large underdetermined systems of equations, the minimal 𝓁1‐norm near‐solution approximates the sparsest near‐solution
- For most large underdetermined systems of linear equations the minimal 𝓁1‐norm solution is also the sparsest solution
- From convex feasibility to convex constrained optimization using block action projection methods and underrelaxation
- Full convergence of the steepest descent method with inexact line searches
- Gradient Convergence in Gradient methods with Errors
- Incremental gradient algorithms with stepsizes bounded away from zero
- Incremental subgradient methods for nondifferentiable optimization
- Incremental subgradients for constrained convex optimization: A unified framework and new methods
- Mathematical methods in image reconstruction
- Near-Optimal Signal Recovery From Random Projections: Universal Encoding Strategies?
- Nonlinear total variation based noise removal algorithms
- Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information
- Signal Recovery and the Large Sieve
- Stable signal recovery from incomplete and inaccurate measurements
- Two facts on the convergence of the Cauchy algorithm
Cited in
(9)- Projected subgradient minimization versus superiorization
- Derivative-free superiorization with component-wise perturbations
- \(\epsilon\)-subgradient algorithms for bilevel convex optimization
- A first order method for solving convex bilevel optimization problems
- String-averaging projected subgradient methods for constrained minimization
- An alternating linearization method with inexact data for bilevel nonsmooth convex optimization
- Alternated and multi-step inertial approximation methods for solving convex bilevel optimization problems
- scientific article; zbMATH DE number 5176444 (Why is no real title available?)
- A primal nonsmooth reformulation for bilevel optimization problems
This page was built for publication: On perturbed steepest descent methods with inexact line search for bilevel convex optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3112499)
