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 … Read more

Bicriteria Traffic Assignment

The classical traffic assignment problem determines the equilibrium flows on a congested network with many infinitesimal users who choose paths to minimize their own travel times. Travelers care about cost (including tolls) as well as time, and different travelers put different weights on these two criteria. We study a bicriteria traffic assignment problem in which … Read more

Lower- and upper-C² integrands: a structured class of functions for stochastic nonconvex optimization

We study nonconvex stochastic functions that admit a structured second-order representation, a generalization of lower- and upper-C² functions to normal integrands. Similarly to the deterministic case, lower-C² normal integrands are defined as the pointwise maxima over a compact random index set of functions that are twice-continuously differentiable in the decision variable with an integrable bounded … Read more

A Stochastic Proximal-Gradient Method for Regularized Generally Constrained Continuous Optimization

A stochastic proximal-gradient method is proposed and analyzed for solving regularized optimization problems subject to nonlinear equality constraints and nonnegativity bounds. The objective function’s values and gradients are available only through inexact stochastic oracles. The method decomposes each trial step into one component that reduces linearized infeasibility and a second component that seeks optimality while … Read more

Primal-dual forward-reflected splitting with linesearch for distributed min-max problems under local Lipschitz smoothness

We consider a network of finitely many agents aiming to cooperatively solve a convex-concave min-max problem combining nonsmooth terms with a smooth saddle function whose partial gradients are only locally Lipschitz continuous. Without requiring prior knowledge of the local Lipschitz moduli of the partial gradients, we propose a distributed proximal-reflected-gradient algorithm which incorporates a distributed … Read more

Robust and Distributionally Robust Risk Budgeting with Mean Absolute Deviation

We propose robust and distributionally robust formulations of the risk budgeting problem under the mean absolute deviation (MAD) risk measure. The proposed models address uncertainty in asset returns and their distribution while allocating portfolio risk according to prescribed risk budgets. We first develop a robust model in which historical return observations are perturbed within a … Read more

A note on optimality conditions for optimization problems with empty limiting subdifferentials

We study first-order optimality for constrained composite optimization problems whose objective is the sum of a locally Lipschitz function and a proper lower semicontinuous function. We focus on the case in which the limiting subdifferential of the latter function is empty at a point of interest, so that the usual KKT conditions are unavailable. We … Read more

Transferability of Error Bounds and the Kurdyka-Lojasiewicz Property under $C^1$ Partial Smoothness

This work studies how a generalized error bound (GEB) property in the ambient Euclidean space transfers to the active manifold under \(\mathcal{C}^1\) partial smoothness. The GEB generalizes the standard error bound, which upper bounds the distance to a subset of critical points using first-order stationarity residuals, by allowing the distance to be composed with a … Read more

A sufficient convergence condition for generalized Benders decomposition with general dual functions

We revisit the framework of generalized Benders decomposition over a compact but non-finite master domain. We show by counterexample that strong general dual functions alone may fail to guarantee convergence. We then define a condition of uniform local strongness and prove that strong general dual functions satisfying this condition guarantee finite \(\epsilon\)-termination. Finally, we show … Read more

New adaptive proximal gradient algorithms for solving multiobjective composite optimization problems

In this paper, we propose new adaptive proximal gradient algorithms to solve multiobjective optimization problems, where each objective function is the sum of a differentiable function and a proper, closed, convex function. Utilizing the local behavior of the differentiable terms we propose new adaptive ways to select stepsizes used in proximal gradient scheme. In particular, … Read more