An Augmented Lagrangian Approach to Bi-Level Optimization via a Smooth Equilibrium Constrained Problem

Abstract Optimization problems involving smooth equilibrium constraints capture diverse optimization settings such as bi-level optimization, min-max problems and games, and the minimization over non-linear constraints. This paper introduces an Augmented Lagrangian approach with Hessian-vector product approximation to address an equilibrium constrained nonconvex nonsmooth optimization problem in which the equilibrium constraint is given by nonlinear equality constraints originating from the Fermat Condition of a continuously differentiable function. The underlying model in particular captures various settings of bi-level optimization problems, including those in which the inner problem may have a non-singleton set of optimal solutions. The proposed method attains approximated critical points and enjoys a standard rate of convergence after stabilization. It does not require double-loops, nested procedures, nor any Hessian computation, and subsequently bypasses any matrix storage requirements. We complement the theoretical results with numerical illustrations demonstrating the implementation of our method in a bi-level application and test problem.

Authors

Institutions

Publication Details

Journal
Journal of Optimization Theory and Applications
Published
2026-02-18
DOI
https://doi.org/10.1007/s10957-025-02913-z
Primary Topic
Advanced Optimization Algorithms Research
Type
article
Field-Weighted Citation Impact
0.00

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

An Augmented Lagrangian Approach to Bi-Level Optimization via a Smooth Equilibrium Constrained Problem

Nadav Hallak, Nitay Suissa
Journal of Optimization Theory and Applications
Advanced Optimization Algorithms Research
article

An Augmented Lagrangian Approach to Bi-Level Optimization via a Smooth Equilibrium Constrained Problem

Nadav Hallak, Nitay Suissa
article en

Abstract

Abstract Optimization problems involving smooth equilibrium constraints capture diverse optimization settings such as bi-level optimization, min-max problems and games, and the minimization over non-linear constraints. This paper introduces an Augmented Lagrangian approach with Hessian-vector product approximation to address an equilibrium constrained nonconvex nonsmooth optimization problem in which the equilibrium constraint is given by nonlinear equality constraints originating from the Fermat Condition of a continuously differentiable function. The underlying model in particular captures various settings of bi-level optimization problems, including those in which the inner problem may have a non-singleton set of optimal solutions. The proposed method attains approximated critical points and enjoys a standard rate of convergence after stabilization. It does not require double-loops, nested procedures, nor any Hessian computation, and subsequently bypasses any matrix storage requirements. We complement the theoretical results with numerical illustrations demonstrating the implementation of our method in a bi-level application and test problem.

Journal of Optimization Theory and ApplicationsVol. 208(3)
Technion – Israel Institute of Technology (IL)
Technion-Israel Institute of Technology
Openalex Percentile: Top 49%
Advanced Optimization Algorithms Research
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.