A partially inexact bundle method for convex semi-infinite minmax problems

DOI10.1016/J.CNSNS.2014.07.033zbMath1338.90451OpenAlexW1980468836MaRDI QIDQ907208

Giovanni Giallombardo, Antonio Fuduli, Manlio Gaudioso, Giovanna Miglionico

Publication date: 25 January 2016

Published in: Communications in Nonlinear Science and Numerical Simulation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cnsns.2014.07.033

zbMATH Keywords

nonsmooth optimizationbundle methodsinexact oraclessemi-infinite minmax

Mathematics Subject Classification ID

Minimax problems in mathematical programming (90C47) Semi-infinite programming (90C34)

Related Items (13)

A feasible proximal bundle algorithm with convexification for nonsmooth, nonconvex semi-infinite programming ⋮ Constrained incremental bundle method with partial inexact oracle for nonsmooth convex semi-infinite programming problems ⋮ A method for convex minimization based on translated first-order approximations ⋮ Adaptive Bundle Methods for Nonlinear Robust Optimization ⋮ Numerical infinitesimals in a variable metric method for convex nonsmooth optimization ⋮ Preface to the special issue NUMTA 2013 ⋮ Diagonal bundle method with convex and concave updates for large-scale nonconvex and nonsmooth optimization ⋮ Minimizing nonsmooth DC functions via successive DC piecewise-affine approximations ⋮ Essentials of numerical nonsmooth optimization ⋮ Minimizing Piecewise-Concave Functions Over Polyhedra ⋮ A proximal-projection partial bundle method for convex constrained minimax problems ⋮ Essentials of numerical nonsmooth optimization ⋮ On Solving the Convex Semi-Infinite Minimax Problems via Superlinear 𝒱𝒰 Incremental Bundle Technique with Partial Inexact Oracle

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Primal-dual subgradient methods for convex problems
• On solving the Lagrangian dual of integer programs via an incremental approach
• A bundle modification strategy for convex minimization
• Proximity control in bundle methods for convex nondifferentiable minimization
• Newton's method for convex programming and Tschebyscheff approximation
• Semi-infinite programming and applications to minimax problems
• Globally convergent variable metric method for convex nonsmooth unconstrained minimization
• New variants of bundle methods
• Methods of descent for nondifferentiable optimization
• Incremental Subgradient Methods for Nondifferentiable Optimization
• The Cutting-Plane Method for Solving Convex Programs
• A descent algorithm for nonsmooth convex optimization
• A modification and an extension of Lemarechal’s algorithm for nonsmooth minimization
• Quadratic Approximations in Convex Nondifferentiable Optimization
• A Version of the Bundle Idea for Minimizing a Nonsmooth Function: Conceptual Idea, Convergence Analysis, Numerical Results
• A D.C. Optimization Algorithm for Solving the Trust-Region Subproblem
• Minimizing Nonconvex Nonsmooth Functions via Cutting Planes and Proximity Control
• Survey of Bundle Methods for Nonsmooth Optimization
• Convergence Analysis of Deflected Conditional Approximate Subgradient Methods
• Max–min separability
• An Incremental Method for Solving Convex Finite Min-Max Problems
• An interior point algorithm for computing saddle points of constrained continuous minimax

This page was built for publication: A partially inexact bundle method for convex semi-infinite minmax problems