Active set-based inexact proximal bundle algorithm for stochastic quadratic programming
From MaRDI portal
Cites work
- A globally convergent primal-dual active-set framework for large-scale convex quadratic optimization
- A Lagrangian finite generation technique for solving linear-quadratic problems in stochastic programming
- A proximal bundle method based on approximate subgradients
- A Proximal Bundle Method with Approximate Subgradient Linearizations
- A regularized decomposition method for minimizing a sum of polyhedral functions
- Applying oracles of on-demand accuracy in two-stage stochastic programming -- a computational study
- Asymptotic results of stochastic decomposition for two-stage stochastic quadratic programming
- Bundle-type methods for inexact data
- Convex proximal bundle methods in depth: a unified analysis for inexact oracles
- Decomposition based interior point methods for two-stage stochastic convex quadratic programs with recourse
- Duality in quadratic programming
- Finite master programs in regularized stochastic decomposition
- Globally convergent primal-dual active-set methods with inexact subproblem solves
- Handbook of probability
- scientific article; zbMATH DE number 5007543 (Why is no real title available?)
- scientific article; zbMATH DE number 3619637 (Why is no real title available?)
- scientific article; zbMATH DE number 2121076 (Why is no real title available?)
- scientific article; zbMATH DE number 5060482 (Why is no real title available?)
- Inexact bundle methods for two-stage stochastic programming
- Inexact Cuts in Benders Decomposition
- Introduction to stochastic programming.
- Lectures on stochastic programming. Modeling and theory
- Level bundle methods for oracles with on-demand accuracy
- New variants of bundle methods
- Newton's method for quadratic stochastic programs with recourse
- Primal and dual active-set methods for convex quadratic programming
- Programming Under Uncertainty: The Equivalent Convex Program
- Proximal level bundle methods for convex nondifferentiable optimization, saddle-point problems and variational inequalities
- Scenarios and Policy Aggregation in Optimization Under Uncertainty
- Solving two-stage stochastic programming problems with level decomposition
- Stochastic Decomposition for Two-Stage Stochastic Linear Programs with Random Cost Coefficients
- Stochastic decomposition. A statistical method for large scale stochastic linear programming
- The Primal-Dual Active Set Method for Nonlinear Optimal Control Problems with Bilateral Constraints
- The Primal-Dual Active Set Strategy as a Semismooth Newton Method
This page was built for publication: Active set-based inexact proximal bundle algorithm for stochastic quadratic programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6859700)
