Cover Image

A Surrogate Value Function Formulation for Bilevel Optimization

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Xu, Mengwei, Dai, Yu-Hong, Liu, Xin-Wei, Ma, Meiqi
Format:	Preprint
Published:	2025
Subjects:	Optimization and Control 90C26, 90C30, 90C33
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

On Constraint Qualifications for MPECs with Applications to Bilevel Hyperparameter Optimization for Machine Learning
by: Li, Jiani, et al.
Published: (2025)

Derivative-Free Bilevel Optimization with Inexact Lower-Level Solutions
by: Cesaroni, Edoardo, et al.
Published: (2026)

Optimistic Bilevel Optimization with Composite Lower-Level Problem
by: Solla, Mattia, et al.
Published: (2026)

ZOBA: An Efficient Single-loop Zeroth-order Bilevel Optimization Algorithm
by: Rando, Marco, et al.
Published: (2026)

Characterizations of Strongly Quasiconvex Functions
by: Hadjisavvas, Nicolas, et al.
Published: (2025)

Optimization over convex polyhedra via Hadamard parametrizations
by: Tang, Tianyun, et al.
Published: (2024)

Lagrangian Reformulation for Nonconvex Optimization: Tailoring Problems to Specialized Solvers
by: Quintero, Rodolfo A., et al.
Published: (2024)

Splitting Proximal Point Algorithms for the Sum of Prox-Convex Functions
by: de Brito, Jose, et al.
Published: (2026)

Combining Gradient Information and Primitive Directions for High-Performance Mixed-Integer Optimization
by: Lapucci, Matteo, et al.
Published: (2024)

Improving Convergence Guarantees of Random Subspace Second-order Algorithm for Nonconvex Optimization
by: Higuchi, Rei, et al.
Published: (2024)

On the Convexity of the Solution Set of Linear Complementarity Problem over Tensor Spaces
by: Sharma, Sonali, et al.
Published: (2026)

On stability of the Scholtes regularization for mathematical programs with complementarity constraints
by: Shikhman, Vladimir, et al.
Published: (2025)

On Tackling High-Dimensional Nonconvex Stochastic Optimization via Stochastic First-Order Methods with Non-smooth Proximal Terms and Variance Reduction
by: Xie, Yue, et al.
Published: (2025)

Norm-induced Cuts: Outer Approximation for Lipschitzian Constraint Functions
by: Göß, Adrian, et al.
Published: (2024)

Second-Order Necessary Conditions, Constraint Qualifications and Exact Penalty for Mathematical Programs with Switching Constraints
by: Chen, Jiawei, et al.
Published: (2024)

Interval-Valued Optimization Problems for Strongly LU-E-Invex and Strongly LU-E-Preinvex Functions
by: Tauheed, et al.
Published: (2026)

Extending Linear Convergence of the Proximal Point Algorithm: The Quasar-Convex Case
by: de Brito, José, et al.
Published: (2025)

A Globally Convergent Gradient Method with Momentum
by: Lapucci, Matteo, et al.
Published: (2024)

Duality-based single-level reformulations of bilevel optimization problems
by: Dempe, Stephan, et al.
Published: (2024)

A Barrier Function Approach for Bilevel Optimization with Coupled Lower-Level Constraints: Formulation, Approximation and Algorithms
by: Jiang, Xiaotian, et al.
Published: (2024)

A four-operator splitting algorithm for nonconvex and nonsmooth optimization
by: Alcantara, Jan Harold, et al.
Published: (2024)

A KL-based Analysis Framework with Applications to Non-Descent Optimization Methods
by: Qiu, Junwen, et al.
Published: (2024)

A heavy-ball type curve search method for smooth convexly constrained optimization
by: Donnini, Federica, et al.
Published: (2026)

Optimality Conditions and Duality for Multiobjective Fractional Bilevel Optimization Problems
by: Lara, Felipe, et al.
Published: (2025)

Projection-based curve pattern search for black-box optimization over smooth convex sets
by: Jia, Xiaoxi, et al.
Published: (2025)

Penalty decomposition derivative free method for the minimization of partially separable functions over a convex feasible set
by: Cecere, Francesco, et al.
Published: (2025)

Bound tightening in lifted formulations: (sub)solver-dependent impact on performance in RLT-based algorithms
by: González-Díaz, Julio, et al.
Published: (2025)

Effective Front-Descent Algorithms with Convergence Guarantees
by: Lapucci, Matteo, et al.
Published: (2024)

On convergence of a $q$-random coordinate constrained algorithm for non-convex problems
by: Ghaffari-Hadigheh, Alireza, et al.
Published: (2022)

Optimality Conditions and Numerical Algorithms for a Class of Minimax Bilevel Optimization Problems
by: Hu, Yaling, et al.
Published: (2026)

Star Quasiconvexity: a Unified Approach for Linear Convergence of First-Order Methods Beyond Convexity
by: Khanh, Phan Quoc, et al.
Published: (2025)

A Barrier-Metric First-Order Method for Linearly Constrained Bilevel Optimization
by: Hong, Tenglong, et al.
Published: (2026)

A Stochastic Quasi-Newton Method in the Absence of Common Random Numbers
by: Menickelly, Matt, et al.
Published: (2023)

A minimal face constant rank constraint qualification for reducible conic programming
by: Andreani, Roberto, et al.
Published: (2023)

Convergence, Duality and Well-Posedness in Convex Bilevel Optimization
by: Giang-Tran, Khanh-Hung, et al.
Published: (2025)

Clash of MINLP Relaxations: Piecewise Linear vs. Global Parabolic
by: Göß, Adrian
Published: (2026)

Parabolic Approximation & Relaxation for MINLP
by: Göß, Adrian, et al.
Published: (2024)

Benign landscapes of low-dimensional relaxations for orthogonal synchronization on general graphs
by: McRae, Andrew D., et al.
Published: (2023)

Hidden convexity of quadratic systems and its application to quadratic programming
by: Huy, Nguyen Quang, et al.
Published: (2026)

Riemannian Gradient Method with Momentum
by: Leggio, Filippo, et al.
Published: (2026)