Direct theorems in semi-infinite convex programming
From MaRDI portal
Publication:3923950
Cites work
- 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?)
- 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, HAAR PROGRAMS, AND FINITE SEQUENCE SPACES
- Duality in semi-infinite programs and some works of Haar and Carathéodory
- Helly's theorem and minima of convex functions
- On Representations of Semi-Infinite Programs which Have No Duality Gaps
- Proper Efficient Points for Maximizations with Respect to Cones
- Proper efficiency and the theory of vector maximization
- 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)- Near-optimal solutions of convex semi-infinite programs via targeted sampling
- Optimality conditions and duality for semi-infinite programming involving B-arcwise connected functions
- Uniform duality in semi-infinite convex optimization
- Convex SIP problems with finitely representable compact index sets: immobile indices and the properties of the auxiliary NLP problem
- On semi-infinite systems of convex polynomial inequalities and polynomial optimization problems
- Suggested research topics in sensitivity and stability analysis for semi- infinite programming problems
- Semi-infinite programming, duality, discretization and optimality conditions†
- Convex semi-infinite games
- Reduction and Discrete Approximation in Linear Semi-Infinite Programming
- Evolutionary approach to the functional diagnostics of dynamic systems: Part 2
- Inequality systems and minimax theorems
- Necessary conditions and duality for inexact nonlinear semi-infinite programming problems
- Attaining the Chebyshev bound for optimal learning: a numerical algorithm
- A duality theorem for semi-infinite convex programs and their finite subprograms
- Duality in infinite dimensional linear programming
- Nonconvex theorems of the alternative and minimization
- Cutting plane algorithms for robust conic convex optimization problems
- Optimality conditions for semi-infinite and generalized semi-infinite programs via lower order exact penalty functions
- On regularity and stability in semi-infinite optimization
- Duality for inexact semi-infinite linear programming
- Optimality conditions for nondifferentiable convex semi-infinite programming
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)
