An Efficient Algorithm for Min-Max Convex Semi-Infinite Programming Problems

DOI10.1080/01630563.2016.1191033zbMath1348.90574OpenAlexW2407023813MaRDI QIDQ2829601

Soon-Yi Wu, Li-ping Zhang

Publication date: 8 November 2016

Published in: Numerical Functional Analysis and Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/01630563.2016.1191033

zbMATH Keywords

convex programmingsemi-infinite programmingexchange method

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Convex programming (90C25) Nonlinear programming (90C30) Algorithms for approximation of functions (65D15)

Related Items

A discretization algorithm for nonsmooth convex semi-infinite programming problems based on bundle methods

Cites Work

• Algorithms for finite and semi-infinite Min-Max-Min problems using adaptive smoothing techniques
• On the use of augmented Lagrangians in the solution of generalized semi-infinite min-max problems
• A globally convergent SQP method for semi-infinite nonlinear optimization
• Discretization methods for the solution of semi-infinite programming problems
• On the use of consistent approximations in the solution of semi-infinite optimization and optimal control problems
• Generalized semi-infinite programming: numerical aspects
• A New Exchange Method for Convex Semi-Infinite Programming
• Semi-Infinite Programming: Theory, Methods, and Applications
• Penalty and Smoothing Methods for Convex Semi-Infinite Programming
• An iterative method for solving KKT system of the semi-infinite programming
• On Linear Semi-Infinite Programming Problems: An Algorithm
• A Multiple Exchange Algorithm for Multivariate Chebyshev Approximation
• A nonlinear programming approach to optimal design centering, tolerancing, and tuning
• Local Convergence of SQP Methods in Semi-Infinite Programming

This page was built for publication: An Efficient Algorithm for Min-Max Convex Semi-Infinite Programming Problems