A feasible proximal bundle algorithm with convexification for nonsmooth, nonconvex semi-infinite programming

Cites Work

Title not available (Why is that?)
Approximate convexity and submonotonicity.
A Redistributed Proximal Bundle Method for Nonconvex Optimization
Submonotone Subdifferentials of Lipschitz Functions
Semismooth and Semiconvex Functions in Constrained Optimization
Title not available (Why is that?)
Semi-Infinite Programming: Theory, Methods, and Applications
Title not available (Why is that?)
An Infeasible Bundle Method for Nonsmooth Convex Constrained Optimization without a Penalty Function or a Filter
Semi-infinite programming
A bundle-filter method for nonsmooth convex constrained optimization
Global solution of semi-infinite programs
Constrained incremental bundle method with partial inexact oracle for nonsmooth convex semi-infinite programming problems
A New Exchange Method for Convex Semi-Infinite Programming
An implementation of a discretization method for semi-infinite programming
A Central Cutting Plane Algorithm for Convex Semi-Infinite Programming Problems
Solving semi-infinite programs by smoothing projected gradient method
Discretization in semi-infinite programming: the rate of convergence
A proximal bundle method for nonsmooth nonconvex functions with inexact information
A partially inexact bundle method for convex semi-infinite minmax problems
A feasible SQP-GS algorithm for nonconvex, nonsmooth constrained optimization
An Algorithm for the Inequality-Constrained Discrete Min--Max Problem
Interval methods for semi-infinite programs
Global optimization of semi-infinite programs via restriction of the right-hand side
The Adaptive Convexification Algorithm: A Feasible Point Method for Semi-Infinite Programming
Relaxation-Based Bounds for Semi-Infinite Programs
The adaptive convexification algorithm for semi-infinite programming with arbitrary index sets
Constrained nonconvex nonsmooth optimization via proximal bundle method
Global optimization of generalized semi-infinite programs via restriction of the right hand side
Relaxed cutting plane method with convexification for solving nonlinear semi-infinite programming problems
Introduction to Nonsmooth Optimization
A proximal bundle method for constrained nonsmooth nonconvex optimization with inexact information
A hybrid discretization algorithm with guaranteed feasibility for the global solution of semi-infinite programs
An infeasible bundle method for nonconvex constrained optimization with application to semi-infinite programming problems
A discretization algorithm for nonsmooth convex semi-infinite programming problems based on bundle methods
A new infeasible proximal bundle algorithm for nonsmooth nonconvex constrained optimization
A filter proximal bundle method for nonsmooth nonconvex constrained optimization
An approximate bundle method for solving nonsmooth equilibrium problems
Feasible Method for Semi-Infinite Programs

Cited In (6)

Proximal bundle algorithms for nonlinearly constrained convex minimax fractional programs
A feasible point method with bundle modification for nonsmooth convex constrained optimization
Proximal level bundle methods for convex nondifferentiable optimization, saddle-point problems and variational inequalities
A stochastic approximation method for convex programming with many semidefinite constraints
New proximal bundle algorithm based on the gradient sampling method for nonsmooth nonconvex optimization with exact and inexact information
A proximal bundle method-based algorithm with penalty strategy and inexact oracles for constrained nonsmooth nonconvex optimization

Uses Software

SLQP-GS

This page was built for publication: A feasible proximal bundle algorithm with convexification for nonsmooth, nonconvex semi-infinite programming

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2129642)