Feasible Method for Semi-Infinite Programs

DOI10.1137/140982143zbMath1329.90148OpenAlexW2194452017MaRDI QIDQ3461986

Shuxiong Wang, Ya-Xiang Yuan

Publication date: 4 January 2016

Published in: SIAM Journal on Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/140982143

zbMATH Keywords

concave optimizationsemi-infinite programsadaptive subdivision algorithm

Mathematics Subject Classification ID

Nonconvex programming, global optimization (90C26) Nonlinear programming (90C30) Semi-infinite programming (90C34)

Related Items

A feasible proximal bundle algorithm with convexification for nonsmooth, nonconvex semi-infinite programming ⋮ Frameworks and results in distributionally robust optimization ⋮ Primal-dual path following method for nonlinear semi-infinite programs with semi-definite constraints ⋮ A modified exchange algorithm for distributional robust optimization and applications in risk management ⋮ Optimality analysis of a class of semi-infinite programming problems ⋮ Decomposition algorithm for distributionally robust optimization using Wasserstein metric with an application to a class of regression models ⋮ Distributionally robust optimization. A review on theory and applications

Uses Software

• INTLAB

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Optimal control of nonlinear switched systems: computational methods and applications
• Global optimization of generalized semi-infinite programs via restriction of the right hand side
• Feasible method for generalized semi-infinite programming
• Semi-infinite programming
• A new smoothing Newton-type algorithm for semi-infinite programming
• Lipschitzian optimization without the Lipschitz constant
• Semi-infinite optimization: Structure and stability of the feasible set
• The design of FIR filters in the complex plane by convex optimization
• Bi-level strategies in semi-infinite programming.
• Interval analysis: Theory and applications
• Interval methods for semi-infinite programs
• Global solution of semi-infinite programs
• The adaptive convexification algorithm for semi-infinite programming with arbitrary index sets
• How to solve a semi-infinite optimization problem
• Mathematical Programs with Complementarity Constraints: Stationarity, Optimality, and Sensitivity
• A New Exchange Method for Convex Semi-Infinite Programming
• Global optimization of semi-infinite programs via restriction of the right-hand side
• A novel feasible discretization method for linear semi-infinite programming applied to basket option pricing
• Theory and Applications of Robust Optimization
• Semi-Infinite Programming: Theory, Methods, and Applications
• An iterative method for solving KKT system of the semi-infinite programming
• The Adaptive Convexification Algorithm: A Feasible Point Method for Semi-Infinite Programming
• Relaxation-Based Bounds for Semi-Infinite Programs
• Interval Slopes for Rational Functions and Associated Centered Forms
• Approximation to Optimization Problems: An Elementary Review
• A cutting-plane method for quadratic semi infinite programming problems
• A necessary and sufficient regularity condition to have bounded multipliers in nonconvex programming
• Convex Analysis
• Set-valued analysis
• Computational discretization algorithms for functional inequality constrained optimization