Pages that link to "Item:Q3308653"
From MaRDI portal
The following pages link to A duality theorem for semi-infinite convex programs and their finite subprograms (Q3308653):
Displaying 12 items.
- On constraint qualifications in nonsmooth optimization. (Q703169) (← links)
- Limiting Lagrangians: A primal approach (Q761250) (← links)
- A one-phase algorithm for semi-infinite linear programming (Q911454) (← links)
- Convex semi-infinite games (Q1065725) (← links)
- In a semi-infinite program only a countable subset of the constraints is essential (Q1079497) (← links)
- Optimal value function in semi-infinite programming (Q1093526) (← links)
- A note on d-stability of convex programs and limiting Lagrangians (Q1184349) (← links)
- A purification algorithm for semi-infinite programming (Q1197680) (← links)
- Zero duality gaps in infinite-dimensional programming (Q1263531) (← links)
- Duality for convex infinite optimization on linear spaces (Q2080839) (← links)
- Relaxed Lagrangian duality in convex infinite optimization: reducibility and strong duality (Q5879572) (← links)
- Optimality and duality analysis for multiobjective interval-valued semi-Infinite optimization problem having vanishing constraints (Q6125399) (← links)