Linear conic and two-stage stochastic optimization revisited via semi-infinite optimization

Cites Work

Title not available (Why is that?)
Title not available (Why is that?)
Title not available (Why is that?)
Title not available (Why is that?)
Title not available (Why is that?)
Two-stage stochastic linear programs with incomplete information on uncertainty
Optimal value function in semi-infinite programming
Locally Farkas-Minkowski linear inequality systems
Scenario reduction in stochastic programming
On the characterization of some families of closed convex sets
A semi-infinite programming approach to two-stage stochastic linear programs with high-order moment constraints
Stability of the duality gap in linear optimization
Recent contributions to linear semi-infinite optimization: an update
Stochastic linear programming. Models, theory, and computation
Characterizations of interiors of feasible and infeasible data instances and feasibility for conic linear programming
Selected applications of linear semi-infinite systems theory
Problem-based optimal scenario generation and reduction in stochastic programming
Conic linear programming duals for classes of quadratic semi-infinite programs with applications
Extension of the LP-Newton method to conic programming problems via semi-infinite representation
Modeling, inference and optimization of regulatory networks based on time series data
A semidefinite programming based polyhedral cut and price approach for the maxcut problem
On duality theory of conic linear problems.
Duality in semi-infinite programs and some works of Haar and Carathéodory
Post-Optimal Analysis in Linear Semi-Infinite Optimization
Genericity Results in Linear Conic Programming—A Tour d’Horizon
Stability of the primal-dual partition in linear semi-infinite programming
Sensitivity Analysis in Linear Semi-Infinite Programming via Partitions
DUALITY, HAAR PROGRAMS, AND FINITE SEQUENCE SPACES
Robust optimization in spline regression models for multi-model regulatory networks under polyhedral uncertainty
Numerical treatment of a class of semi‐infinite programming problems
On Representations of Semi-Infinite Programs which Have No Duality Gaps
On the theory of semi‐infinite programming and a generalization of the kuhn‐tucker saddle point theorem for arbitrary convex functions
Convex Analysis
On the Computational Solution of a Class of Generalized Moment Problems
Relaxed Lagrangian duality in convex infinite optimization: reducibility and strong duality
Scenarios for multistage stochastic programs

This page was built for publication: Linear conic and two-stage stochastic optimization revisited via semi-infinite optimization

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