Direct theorems in semi-infinite convex programming
DOI10.1007/BF01584251zbMATH Open0469.90065DBLPjournals/mp/Borwein81OpenAlexW2048093585WikidataQ56936028 ScholiaQ56936028MaRDI QIDQ3923950FDOQ3923950
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
dualitydirect theoremHelly-type theoremmulticriteria programmingquasi-differentiable programmingabstract programmingexistence of finite subprogramsfinitely many variablesinfinitely constrained programming problemssemi-infinite quasi-convex program
Convex programming (90C25) Sensitivity, stability, parametric optimization (90C31) Programming in abstract spaces (90C48) Duality theory (optimization) (49N15)
Cites Work
- Convex Analysis
- Title not available (Why is that?)
- Proper efficiency and the theory of vector maximization
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- DUALITY, HAAR PROGRAMS, AND FINITE SEQUENCE SPACES
- On Representations of Semi-Infinite Programs which Have No Duality Gaps
- Proper Efficient Points for Maximizations with Respect to Cones
- Title not available (Why is that?)
- Sufficient conditions for extremum, penalty functions and regularity
- The Critical Set of a Convex Body
- Quasi-Convex Programming
- Seven Kinds of Convexity
- Duality in semi-infinite programs and some works of Haar and Carathéodory
- An Infinite Linear Program with a Duality Gap
- Title not available (Why is that?)
- Characterizations of optimality without constraint qualification for the abstract convex program
- Title not available (Why is that?)
- Affine minorants minimizing the sum of convex functions
- Helly's theorem and minima of convex functions
Cited In (21)
- Optimality conditions for nondifferentiable convex semi-infinite programming
- Attaining the Chebyshev bound for optimal learning: a numerical algorithm
- On semi-infinite systems of convex polynomial inequalities and polynomial optimization problems
- Duality for inexact semi-infinite linear programming
- Uniform duality in semi-infinite convex optimization
- Necessary conditions and duality for inexact nonlinear semi-infinite programming problems
- Duality in infinite dimensional linear programming
- Optimality conditions for semi-infinite and generalized semi-infinite programs via lower order exact penalty functions
- Semi-infinite programming, duality, discretization and optimality conditions†
- Reduction and Discrete Approximation in Linear Semi-Infinite Programming
- Optimality conditions and duality for semi-infinite programming involving B-arcwise connected functions
- 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
- A duality theorem for semi-infinite convex programs and their finite subprograms
- On regularity and stability in semi-infinite optimization
- Evolutionary approach to the functional diagnostics of dynamic systems: Part 2
- Convex semi-infinite games
- Suggested research topics in sensitivity and stability analysis for semi- infinite programming problems
- Cutting plane algorithms for robust conic convex optimization problems
- Inequality systems and minimax theorems
- Near-optimal solutions of convex semi-infinite programs via targeted sampling
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)
