Stochastic convex programming: Kuhn-Tucker conditions
From MaRDI portal
Publication:1232360
DOI10.1016/0304-4068(75)90003-8zbMath0343.90039OpenAlexW2059215370MaRDI QIDQ1232360
R. Tyrrell Rockafellar, Roger J.-B. Wets
Publication date: 1975
Published in: Journal of Mathematical Economics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0304-4068(75)90003-8
Related Items
Challenges in optimization with complex PDE-systems. Abstracts from the workshop held February 14--20, 2021 (hybrid meeting), Optimality Conditions and Moreau–Yosida Regularization for Almost Sure State Constraints, Quantitative stability of two-stage stochastic linear variational inequality problems with fixed recourse, Shadow price of information in discrete time stochastic optimization, Two-stage stochastic variational inequalities: an ERM-solution procedure, Recourse-based stochastic nonlinear programming: properties and Benders-SQP algorithms, Stochastic growth with irreversible investment, On stochastic programming ii: dynamic problems under risk∗, Codifferentials and Quasidifferentials of the Expectation of Nonsmooth Random Integrands and Two-Stage Stochastic Programming, Optimality Conditions for Convex Stochastic Optimization Problems in Banach Spaces with Almost Sure State Constraints, Finite dimensional approximation and Newton-based algorithm for stochastic approximation in Hilbert space, Dynamic interaction models of economic equilibrium, Measures as Lagrange multipliers in multistage stochastic programming, Unnamed Item, Convex stochastic programmes with simple recourse, Log-optimal and rapid paths in von Neumann-Gale dynamical systems, Some research directions in mathematical economics, Addressing supply-side risk in uncertain power markets: stochastic Nash models, scalable algorithms and error analysis
Cites Work
- Stochastic convex programming: basic duality
- Stochastic convex programming: Singular multipliers and extended duality, singular multipliers and duality
- Extension of Fenchel's duality theorem for convex functions
- Ordinary convex programs without a duality gap
- Stochastic Convex Programming: Relatively Complete Recourse and Induced Feasibility
- Discrete Dynamic Programming
- Necessary Conditions for Continuous Parameter Stochastic Optimization Problems
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item