A dual parametrization method for convex semi-infinite programming
From MaRDI portal
Publication:5933817
DOI10.1023/A:1019208524259zbMath1007.90072OpenAlexW171676536MaRDI QIDQ5933817
Kok Lay Teo, Yanqun Liu, Satoshi Ito
Publication date: 14 June 2001
Published in: Annals of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1023/a:1019208524259
dualityconvex programmingconverse dualitylinear semi-infinite programmingoptimality conditionquadratic semi-infinite programmingsemi-infinite programming
Numerical mathematical programming methods (65K05) Convex programming (90C25) Semi-infinite programming (90C34)
Related Items
The CoMirror algorithm with random constraint sampling for convex semi-infinite programming, Karush-Kuhn-Tucker optimality conditions and duality for multiobjective semi-infinite programming with vanishing constraints, On duality for mathematical programs with vanishing constraints, Some properties on quadratic infinite programs of integral type, A ladder method for linear semi-infinite programming, Optimality and duality analysis for multiobjective interval-valued semi-Infinite optimization problem having vanishing constraints, Saddle point criteria in semi-infinite minimax fractional programming under (Φ,ρ)-invexity, A new smoothing Newton-type algorithm for semi-infinite programming, Semi-infinite programming approach to continuously-constrained linear-quadratic optimal control problems, An approximation approach to non-strictly convex quadratic semi-infinite programming, Comparative study of RPSALG algorithm for convex semi-infinite programming, An exchange method with refined subproblems for convex semi-infinite programming problems, An inexact primal-dual algorithm for semi-infinite programming, Semi-infinite programming approach to nonlinear time-delayed optimal control problems with linear continuous constraints, Parametric Saddle Point Criteria in Semi-Infinite Minimax Fractional Programming Problems Under (p,r)-Invexity, A smoothing Levenberg-Marquardt algorithm for semi-infinite programming
