Conditioning of linear-quadratic two-stage stochastic optimization problems
Consider the following convex stochastic optimization model of the form \[ \min \left\{ \int_{\mathbb R^s} g(x,\xi) P(d\xi) :x\in X\right\}, \tag{1} \] where \(X\) is a nonempty closed convex subset of \(\mathbb{R}^{m}\), \(P\) a probability distribution on \(\mathbb{R}^{s}\) and \(g\) is an extended real-valued measurable function on \(\mathbb{R}^{m}\times \mathbb{R} ^{s}\) such that \(g(\cdot ,\xi)\) is convex for all \(\xi\) in the support of \(P\). Particular cases of (1) are two-stage linear or linear-quadratic stochastic programs. In this paper, the authors study linear-quadratic two-stage stochastic optimization problems for which a condition number is introduced as a Lipschitz modulus of the multifunction assigning to a (discrete) probability distribution the solution set of the problem. In particular, the authors apply the results to the special setting of so-called simple recourse.
- Conditioning of convex piecewise linear stochastic programs
- Two-stage stochastic standard quadratic optimization
- Two-Stage Stochastic Programming with Linearly Bi-parameterized Quadratic Recourse
- An algorithm for two-stage stochastic quadratic problems
- Necessary conditions in stochastic linear quadratic problems and their applications
- Necessary optimality conditions for two-stage stochastic programming problems
- Publication:3491317
- Quadratic two-stage stochastic optimization with coherent measures of risk
- Optimality conditions for two-stage stochastic second-order cone programming problems with discrete distribution
- Multistage quadratic stochastic programming
- A Condition Number for Differentiable Convex Inequalities
- A Lagrangian finite generation technique for solving linear-quadratic problems in stochastic programming
- Complete Characterization of Openness, Metric Regularity, and Lipschitzian Properties of Multifunctions
- Condition Numbers, the Barrier Method, and the Conjugate-Gradient Method
- Conditioning of convex piecewise linear stochastic programs
- Error Bounds for Piecewise Convex Quadratic Programs and Applications
- scientific article; zbMATH DE number 1099081 (Why is no real title available?)
- scientific article; zbMATH DE number 1502618 (Why is no real title available?)
- Ill-Conditioning and Computational Error in Interior Methods for Nonlinear Programming
- Linear-Quadratic Programming and Optimal Control
- On M-stationary points for a stochastic equilibrium problem under equilibrium constraints in electricity spot market modeling.
- On the Calmness of a Class of Multifunctions
- Perturbation analysis of optimization problems in banach spaces
- Regularity and conditioning of solution mappings in variational analysis
- Scenario reduction algorithms in stochastic programming
- Second-Order Subdifferential Calculus with Applications to Tilt Stability in Optimization
- Some characterizations and properties of the ``distance to the ill-posedness and the condition measure of a conic linear system
- Some continuity properties of polyhedral multifunctions
- The sharp Lipschitz constants for feasible and optimal solutions of a perturbed linear program
- Upper Lipschitz behavior of solutions to perturbed \(C^{1,1}\) programs
- Variational Analysis
- Conditioning of convex piecewise linear stochastic programs
- Quadratic two-stage stochastic optimization with coherent measures of risk
- Optimality conditions for two-stage stochastic second-order cone programming problems with discrete distribution
- A simple formula for the second-order subdifferential of maximum functions
- Full stability in finite-dimensional optimization
This page was built for publication: Conditioning of linear-quadratic two-stage stochastic optimization problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q484135)
