Algorithms for simple bilevel programming

DOI10.1007/978-3-030-52119-6_9MaRDI QIDQ5014631zbMATH OpenOpenAlexFDO

Authors Joydeep Dutta, T. Pandit

Publication date 8 December 2021

Published in Bilevel Optimization (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-030-52119-6_9

zbMATH Keywords

bilevel programming problemsconvex functionsconvex optimizationgradient Lipschitz conditionprojected gradient methodproximal point methodstrongly convex functions

Mathematics Subject Classification ID

Convex programming (90C25)

Recommendations

• On the solution of convex bilevel optimization problems
• A simple algorithm for the-linear bilevel programming problem
• On solving simple bilevel programs with a nonconvex lower level program
• Practical bilevel optimization. Algorithms and applications
• Bilevel Programming

Cites work

• -subgradient algorithms for bilevel convex optimization
• A Bundle Method for a Class of Bilevel Nonsmooth Convex Minimization Problems
• A first order method for finding minimal norm-like solutions of convex optimization problems
• A first order method for solving convex bilevel optimization problems
• An inertial extrapolation method for convex simple bilevel optimization
• Equivalent Unconstrained Minimization and Global Error Bounds for Variational Inequality Problems
• Foundations of bilevel programming
• Foundations of Optimization
• scientific article; zbMATH DE number 5982713 (Why is no real title available?)
• scientific article; zbMATH DE number 439380 (Why is no real title available?)
• scientific article; zbMATH DE number 1328979 (Why is no real title available?)
• scientific article; zbMATH DE number 5176444 (Why is no real title available?)
• Is bilevel programming a special case of a mathematical program with complementarity constraints?
• Methods of descent for nondifferentiable optimization
• New necessary optimality conditions in optimistic bilevel programming
• Optimality Conditions for a Simple Convex Bilevel Programming Problem
• Optimality conditions for bilevel programming: an approach through variational analysis
• Proximal Point Algorithm Controlled by a Slowly Vanishing Term: Applications to Hierarchical Minimization
• Simple bilevel programming and extensions
• The Cutting-Plane Method for Solving Convex Programs
• VI-constrained hemivariational inequalities: distributed algorithms and power control in ad-hoc networks

Cited in

(13)

• An online convex optimization-based framework for convex bilevel optimization
• Bilevel convex programming models
• A simple algorithm for the-linear bilevel programming problem
• scientific article; zbMATH DE number 1353814 (Why is no real title available?)
• Algorithms for Linear Bilevel Optimization
• Direct search algorithm for bilevel programming problems
• Bilevel Programming
• An inertial extrapolation method for convex simple bilevel optimization
• Methodology and first-order algorithms for solving nonsmooth and non-strongly convex bilevel optimization problems
• Algorithmic schemes for non-smooth simple bilevel programming problem and simple MPEC problem
• Two regularized inertial Tseng methods for solving inclusion problems with applications to convex bilevel programming
• A projection-free method for solving convex bilevel optimization problems
• A smoothing augmented Lagrangian method for solving simple bilevel programs

This page was built for publication: Algorithms for simple bilevel programming

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5014631)