Direct theorems in semi-infinite convex programming

DOI10.1007/BF01584251MaRDI QIDQ3923950zbMATH OpenOpenAlexDBLPWikidataFDO

Authors Jonathan M. Borwein

Publication date 1981

Published in Mathematical Programming (Search for Journal in Brave)

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

zbMATH Keywords

abstract programmingdirect theoremdualityexistence of finite subprogramsfinitely many variablesHelly-type theoreminfinitely constrained programming problemsmulticriteria programmingquasi-differentiable programmingsemi-infinite quasi-convex program

Mathematics Subject Classification ID

Duality theory (optimization) (49N15) Convex programming (90C25) Sensitivity, stability, parametric optimization (90C31) Programming in abstract spaces (90C48)

Cites work

• Affine minorants minimizing the sum of convex functions
• An Infinite Linear Program with a Duality Gap
• Characterizations of optimality without constraint qualification for the abstract convex program
• Convex Analysis
• Duality in semi-infinite programs and some works of Haar and Carathéodory
• DUALITY, HAAR PROGRAMS, AND FINITE SEQUENCE SPACES
• Helly's theorem and minima of convex functions
• scientific article; zbMATH DE number 3694044 (Why is no real title available?)
• scientific article; zbMATH DE number 3613650 (Why is no real title available?)
• scientific article; zbMATH DE number 3214278 (Why is no real title available?)
• scientific article; zbMATH DE number 3253716 (Why is no real title available?)
• scientific article; zbMATH DE number 3281211 (Why is no real title available?)
• scientific article; zbMATH DE number 3323651 (Why is no real title available?)
• scientific article; zbMATH DE number 3059659 (Why is no real title available?)
• On Representations of Semi-Infinite Programs which Have No Duality Gaps
• Proper efficiency and the theory of vector maximization
• Proper Efficient Points for Maximizations with Respect to Cones
• Quasi-Convex Programming
• Seven Kinds of Convexity
• Sufficient conditions for extremum, penalty functions and regularity
• The Critical Set of a Convex Body

Cited in

(21)

• Optimality conditions and duality for semi-infinite programming involving B-arcwise connected functions
• Inequality systems and minimax theorems
• Convex semi-infinite games
• Duality in infinite dimensional linear programming
• On regularity and stability in semi-infinite optimization
• Near-optimal solutions of convex semi-infinite programs via targeted sampling
• Suggested research topics in sensitivity and stability analysis for semi- infinite programming problems
• On semi-infinite systems of convex polynomial inequalities and polynomial optimization problems
• Necessary conditions and duality for inexact nonlinear semi-infinite programming problems
• Optimality conditions for semi-infinite and generalized semi-infinite programs via lower order exact penalty functions
• Uniform duality in semi-infinite convex optimization
• A duality theorem for semi-infinite convex programs and their finite subprograms
• Optimality conditions for nondifferentiable convex semi-infinite programming
• Cutting plane algorithms for robust conic convex optimization problems
• Semi-infinite programming, duality, discretization and optimality conditions†
• Reduction and Discrete Approximation in Linear Semi-Infinite Programming
• Evolutionary approach to the functional diagnostics of dynamic systems: Part 2
• Nonconvex theorems of the alternative and minimization
• Convex SIP problems with finitely representable compact index sets: immobile indices and the properties of the auxiliary NLP problem
• Duality for inexact semi-infinite linear programming
• Attaining the Chebyshev bound for optimal learning: a numerical algorithm

This page was built for publication: Direct theorems in semi-infinite convex programming

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