A discretization algorithm for nonsmooth convex semi-infinite programming problems based on bundle methods
From MaRDI portal
Publication:1986106
DOI10.1007/s10589-020-00170-6zbMath1433.90175OpenAlexW3005015339MaRDI QIDQ1986106
Qi Wu, Li-Ping Pang, Jin-He Wang, Qiong Wu
Publication date: 7 April 2020
Published in: Computational Optimization and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10589-020-00170-6
Convex programming (90C25) Derivative-free methods and methods using generalized derivatives (90C56) Semi-infinite programming (90C34)
Related Items (2)
A stochastic approximation method for convex programming with many semidefinite constraints ⋮ A feasible proximal bundle algorithm with convexification for nonsmooth, nonconvex semi-infinite programming
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Constrained incremental bundle method with partial inexact oracle for nonsmooth convex semi-infinite programming problems
- Local reduction based SQP-type method for semi-infinite programs with an infinite number of second-order cone constraints
- Semi-infinite programming
- Exact penalty functions in proximal bundle methods for constrained convex nondifferentiable minimization
- The design of FIR filters in the complex plane by convex optimization
- Semi-infinite programming and applications to minimax problems
- An infeasible bundle method for nonconvex constrained optimization with application to semi-infinite programming problems
- The dual parameterization approach to optimal least square FIR filter design subject to maximum error constraints
- An Efficient Algorithm for Min-Max Convex Semi-Infinite Programming Problems
- Introduction to Nonsmooth Optimization
- A Redistributed Proximal Bundle Method for Nonconvex Optimization
- A New Exchange Method for Convex Semi-Infinite Programming
- Semi-Infinite Programming: Theory, Methods, and Applications
- The Cutting-Plane Method for Solving Convex Programs
- An implementation of a discretization method for semi-infinite programming
- A cutting-plane method for quadratic semi infinite programming problems
- A Version of the Bundle Idea for Minimizing a Nonsmooth Function: Conceptual Idea, Convergence Analysis, Numerical Results
- Linear Chebyshev Approximation of Complex-Valued Functions
- A Central Cutting Plane Algorithm for Convex Semi-Infinite Programming Problems
- A Regularized Explicit Exchange Method for Semi-Infinite Programs with an Infinite Number of Conic Constraints
- A Cutting Surface Algorithm for Semi-Infinite Convex Programming with an Application to Moment Robust Optimization
- An Infeasible Bundle Method for Nonsmooth Convex Constrained Optimization without a Penalty Function or a Filter
- Numerical optimization. Theoretical and practical aspects. Transl. from the French
- Discretization in semi-infinite programming: the rate of convergence
This page was built for publication: A discretization algorithm for nonsmooth convex semi-infinite programming problems based on bundle methods
