An Incremental Method for Solving Convex Finite Min-Max Problems
From MaRDI portal
Publication:5387972
DOI10.1287/moor.1050.0175zbMath1278.90439OpenAlexW2005022214MaRDI QIDQ5387972
Giovanna Miglionico, Giovanni Giallombardo, Manlio Gaudioso
Publication date: 27 May 2008
Published in: Mathematics of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/moor.1050.0175
unconstrained optimizationnonsmooth optimizationonline algorithmscutting planesconvex minimizationbundle methodsincremental methodsfinite min-max
Minimax problems in mathematical programming (90C47) Optimality conditions for minimax problems (49K35)
Related Items (25)
A smooth path-following algorithm for market equilibrium under a class of piecewise-smooth concave utilities ⋮ Constrained incremental bundle method with partial inexact oracle for nonsmooth convex semi-infinite programming problems ⋮ On solving the Lagrangian dual of integer programs via an incremental approach ⋮ Probabilistic optimization via approximate \(p\)-efficient points and bundle methods ⋮ Piecewise linear approximations in nonconvex nonsmooth optimization ⋮ Lower and upper bounds for the spanning tree with minimum branch vertices ⋮ A method for convex minimization based on translated first-order approximations ⋮ A new algorithm for the minimax location problem with the closest distance ⋮ Adaptive Bundle Methods for Nonlinear Robust Optimization ⋮ Incremental Bundle Methods using Upper Models ⋮ An incremental bundle method for portfolio selection problem under second-order stochastic dominance ⋮ A partially inexact bundle method for convex semi-infinite minmax problems ⋮ The effect of deterministic noise in subgradient methods ⋮ An Asynchronous Bundle-Trust-Region Method for Dual Decomposition of Stochastic Mixed-Integer Programming ⋮ Convex proximal bundle methods in depth: a unified analysis for inexact oracles ⋮ A Smooth Inexact Penalty Reformulation of Convex Problems with Linear Constraints ⋮ A generalized gradient projection method based on a new working set for minimax optimization problems with inequality constraints ⋮ Incremental-like bundle methods with application to energy planning ⋮ Essentials of numerical nonsmooth optimization ⋮ Minimizing Piecewise-Concave Functions Over Polyhedra ⋮ A proximal-projection partial bundle method for convex constrained minimax problems ⋮ A splitting bundle approach for non-smooth non-convex minimization ⋮ Optimal replenishment order placement in a finite time horizon ⋮ Essentials of numerical nonsmooth optimization ⋮ On Solving the Convex Semi-Infinite Minimax Problems via Superlinear 𝒱𝒰 Incremental Bundle Technique with Partial Inexact Oracle
This page was built for publication: An Incremental Method for Solving Convex Finite Min-Max Problems
