An interior semi-infinite programming method

DOI10.1007/BF00940304zbMath0628.90068OpenAlexW1974856563MaRDI QIDQ1093544

Vera V. Kovacevic-Vujcic, Miroslav D. Asic

Publication date: 1988

Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf00940304

zbMATH Keywords

discretizationconvex constraintscluster pointssequence of feasible points

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) Semi-infinite programming (90C34)

Related Items (3)

An implicit enumeration method for global optimization problems ⋮ Cascading: An adjusted exchange method for robust conic programming ⋮ A novel feasible discretization method for linear semi-infinite programming applied to basket option pricing

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Globally convergent methods for semi-infinite programming
• A recursive quadratic programming algorithm for semi-infinite optimization problems
• A projected lagrangian algorithm for semi-infinite programming
• Linear Chebyshev approximation without Chebyshev sets

This page was built for publication: An interior semi-infinite programming method