An efficient algorithm for - convex semi-infinite programming problems

DOI10.1080/01630563.2016.1191033MaRDI QIDQ2829601zbMATH OpenOpenAlexFDO

Authors Soon-Yi Wu, Liping 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)

Recommendations

• A new exchange method for convex semi-infinite programming
• On Exchange Methods for Nonlinear Semi-Infinite Programs
• An exchange method with refined subproblems for convex semi-infinite programming problems
• A partially inexact bundle method for convex semi-infinite minmax problems
• Stochastic algorithm for solving convex semi-infinite programming problems with equality and inequality constraints

Cites work

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

Cited in

(6)

• A discretization algorithm for nonsmooth convex semi-infinite programming problems based on bundle methods
• On Exchange Methods for Nonlinear Semi-Infinite Programs
• An exchange method with refined subproblems for convex semi-infinite programming problems
• A new exchange method for convex semi-infinite programming
• Majorization-minimization procedures and convergence of SQP methods for semi-algebraic and tame programs
• Convergent Algorithms for a Class of Convex Semi-infinite Programs

This page was built for publication: An efficient algorithm for \(\min\)-\(\max\) convex semi-infinite programming problems

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