On perturbed steepest descent methods with inexact line search for bilevel convex optimization
From MaRDI portal
Publication:3112499
DOI10.1080/02331934.2010.536231zbMATH Open1233.90233OpenAlexW2047859246MaRDI QIDQ3112499FDOQ3112499
Authors: Elias Salomão Helou Neto, Álvaro Rodolfo De Pierro 
Publication date: 10 January 2012
Published in: Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/02331934.2010.536231
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
- Nonlinear total variation based noise removal algorithms
- Near-Optimal Signal Recovery From Random Projections: Universal Encoding Strategies?
- Decoding by Linear Programming
- Stable signal recovery from incomplete and inaccurate measurements
- Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information
- For most large underdetermined systems of linear equations the minimal 𝓁1‐norm solution is also the sparsest solution
- Compressed sensing
- An overview of bilevel optimization
- Mathematical methods in image reconstruction
- Title not available (Why is that?)
- Convergence of Approximate and Incremental Subgradient Methods for Convex Optimization
- Incremental gradient algorithms with stepsizes bounded away from zero
- From convex feasibility to convex constrained optimization using block action projection methods and underrelaxation
- An Incremental Gradient(-Projection) Method with Momentum Term and Adaptive Stepsize Rule
- Gradient Convergence in Gradient methods with Errors
- A Convergent Incremental Gradient Method with a Constant Step Size
- Incremental subgradient methods for nondifferentiable optimization
- A relaxed version of Bregman's method for convex programming
- A New Class of Incremental Gradient Methods for Least Squares Problems
- Error stability properties of generalized gradient-type algorithms
- Incremental subgradients for constrained convex optimization: A unified framework and new methods
- Full convergence of the steepest descent method with inexact line searches
- For most large underdetermined systems of equations, the minimal 𝓁1‐norm near‐solution approximates the sparsest near‐solution
- A Statistical Model for Positron Emission Tomography
- A simultaneous projections method for linear inequalities
- Signal Recovery and the Large Sieve
- Two facts on the convergence of the Cauchy algorithm
- A Simultaneous Iterative Method for Computing Projections on Polyhedra
- Convergence results for scaled gradient algorithms in positron emission tomography
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
- Title not available (Why is that?)
- 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)
