An algorithm for solving two-level convex optimization problems

DOI10.1080/00207728408926552zbMath0542.90075OpenAlexW1994306362MaRDI QIDQ3330979

No author found.

Publication date: 1984

Published in: International Journal of Systems Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/00207728408926552

zbMATH Keywords

algorithmlarge-scale optimizationgradient methodssteepest descentdifferentiability rulesubgradient formulatwo-level convex optimization

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Convex programming (90C25) Methods of reduced gradient type (90C52) Methods of successive quadratic programming type (90C55)

Related Items (16)

Bilevel and multilevel programming: A bibliography review ⋮ The steepest descent direction for the nonlinear bilevel programming problem ⋮ DC programming techniques for solving a class of nonlinear bilevel programs ⋮ Semismooth Newton-type method for bilevel optimization: global convergence and extensive numerical experiments ⋮ A note on the paper: ``Sufficient optimality conditions using convexifactors for optimistic bilevel programming problem ⋮ Numerically tractable optimistic bilevel problems ⋮ A simple algorithm for the-linear bilevel programming problem ⋮ A Fenchel-Lagrange duality approach for a bilevel programming problem with extremal-value function ⋮ Hierarchical generation of \(\alpha \)-Pareto optimal solutions in large-scale multi-objective non-linear systems with fuzzy parameters ⋮ On the directional derivative of the optimal solution mapping without linear independence constraint qualification ⋮ New necessary optimality conditions in optimistic bilevel programming ⋮ Necessary optimality conditions for nonsmooth generalized semi-infinite programming problems ⋮ Unnamed Item ⋮ Interactions Between Bilevel Optimization and Nash Games ⋮ Hierarchical generation of Pareto optimal solutions in large-scale multiobjective systems ⋮ An Extended Fenchel--Lagrange Duality Approach and Optimality Conditions for Strong Bilevel Programming Problems

Cites Work

• Directional Derivatives for Extremal-Value Functions with Applications to the Completely Convex Case
• Convex Analysis
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: An algorithm for solving two-level convex optimization problems