An algorithm for solving two-level convex optimization problems
From MaRDI portal
Recommendations
- Convex two-level optimization
- Convex two-level optimization problem
- scientific article; zbMATH DE number 4127000
- scientific article; zbMATH DE number 4083400
- A quasiconcave minimization method for solving linear two-level programs
- scientific article; zbMATH DE number 817607
- On an algorithm solving two-level programming problems with nonunique lower level solutions
- On the solution of convex bilevel optimization problems
- Two-level optimization with approximate solutions in the lower level
- A Multilevel Algorithm for the Minimum 2-sum Problem
Cites work
- Convex Analysis
- Directional Derivatives for Extremal-Value Functions with Applications to the Completely Convex Case
- scientific article; zbMATH DE number 3849051 (Why is no real title available?)
- scientific article; zbMATH DE number 3741217 (Why is no real title available?)
- scientific article; zbMATH DE number 3466802 (Why is no real title available?)
- scientific article; zbMATH DE number 3356467 (Why is no real title available?)
Cited in
(27)- Bilevel and multilevel programming: A bibliography review
- The steepest descent direction for the nonlinear bilevel programming problem
- Hierarchical generation of Pareto optimal solutions in large-scale multiobjective systems
- On an algorithm solving two-level programming problems with nonunique lower level solutions
- A note on the paper: ``Sufficient optimality conditions using convexifactors for optimistic bilevel programming problem
- Numerically tractable optimistic bilevel problems
- scientific article; zbMATH DE number 4033511 (Why is no real title available?)
- A simple algorithm for the-linear bilevel programming problem
- Algorithms for two bottleneck optimization problems
- scientific article; zbMATH DE number 4083400 (Why is no real title available?)
- On the directional derivative of the optimal solution mapping without linear independence constraint qualification
- A CONVEX SUBMODEL WITH APPLICATION TO SYSTEM DESIGN
- Interactions between bilevel optimization and Nash games
- Semismooth Newton-type method for bilevel optimization: global convergence and extensive numerical experiments
- Necessary conditions in generalized semi-infinite optimization with nondifferentiable convex data
- An extended Fenchel-Lagrange duality approach and optimality conditions for strong bilevel programming problems
- New necessary optimality conditions in optimistic bilevel programming
- scientific article; zbMATH DE number 2208704 (Why is no real title available?)
- A Fenchel-Lagrange duality approach for a bilevel programming problem with extremal-value function
- Applying tangential subdifferentials in bilevel optimization
- Approximate Karush-Kuhn-Tucker conditions for nonsmooth bilevel optimization problems
- A fresh look at nonsmooth Levenberg–Marquardt methods with applications to bilevel optimization
- A new problem qualification based on approximate KKT conditions for Lipschitzian optimization with application to bilevel programming
- DC programming techniques for solving a class of nonlinear bilevel programs
- Convex two-level optimization problem
- Hierarchical generation of -Pareto optimal solutions in large-scale multi-objective non-linear systems with fuzzy parameters
- Necessary optimality conditions for nonsmooth generalized semi-infinite programming problems
This page was built for publication: An algorithm for solving two-level convex optimization problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3330979)
