Direct Search meets Frank-Wolfe: Inexact Derivative-Free Bilevel Optimization over Polytopes

In this work we propose BLDS-SIMPLEX, a derivative-free direct search method for the solution of bilevel optimization with polytope constraints at the upper level. The proposed method reformulates the feasible set using barycentric coordinates and explores it using Frank-Wolfe-type directions, relying on a fixed-accuracy black-box oracle for the upper-level objective function. We analyze its convergence properties and complexity in the case of smooth reduced objective; additionally, we analyze a variant for the case of nonsmooth objectives and show its convergence to a specific kind of stationary point that we introduce as a natural generalization to the classic stationarity notions in this setting. Numerical tests on modified instances from BOLIB support the viability of our new approach.

Authors

Publication Details

Journal
arXiv (Cornell University)
Published
2026-11-12
DOI
https://doi.org/10.48550/arxiv.2611.16983
Primary Topic
Advanced Optimization Algorithms Research
Type
preprint
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
NOV
preprint

Direct Search meets Frank-Wolfe: Inexact Derivative-Free Bilevel Optimization over Polytopes

Francesco Rinaldi, Matteo Pernini, Marco Viola, Gabriele Sanguin
arXiv (Cornell University)
Advanced Optimization Algorithms Research
preprint

Direct Search meets Frank-Wolfe: Inexact Derivative-Free Bilevel Optimization over Polytopes

Francesco Rinaldi, Matteo Pernini, Marco Viola, Gabriele Sanguin
preprint en

Abstract

In this work we propose BLDS-SIMPLEX, a derivative-free direct search method for the solution of bilevel optimization with polytope constraints at the upper level. The proposed method reformulates the feasible set using barycentric coordinates and explores it using Frank-Wolfe-type directions, relying on a fixed-accuracy black-box oracle for the upper-level objective function. We analyze its convergence properties and complexity in the case of smooth reduced objective; additionally, we analyze a variant for the case of nonsmooth objectives and show its convergence to a specific kind of stationary point that we introduce as a natural generalization to the classic stationarity notions in this setting. Numerical tests on modified instances from BOLIB support the viability of our new approach.

arXiv (Cornell University)
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.

Laika access coming soon