Primal interior-point decomposition algorithms for two-stage stochastic extended second-order cone programming
From MaRDI portal
Publication:4646557
DOI10.1080/02331934.2018.1533553zbMath1416.90024OpenAlexW2897855804MaRDI QIDQ4646557
Publication date: 14 January 2019
Published in: Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/02331934.2018.1533553
stochastic programminginterior-point algorithmsconic programmingself-concordanceextended second-order cone
Semidefinite programming (90C22) Nonlinear programming (90C30) Stochastic programming (90C15) Interior-point methods (90C51)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Decomposition-based interior point methods for stochastic quadratic second-order cone programming
- A logarithmic barrier approach for linear programming
- Homogeneous self-dual algorithms for stochastic second-order cone programming
- The Lyapunov rank of extended second order cones
- An extended variant of Karmarkar's interior point algorithm
- Applications of second-order cone programming
- Second-order cone programming
- Linear complementarity problems on extended second order cones
- How to project onto extended second order cones
- A Lagrangian dual method with self-concordant barriers for multi-stage stochastic convex programming
- Logarithmic barrier decomposition-based interior point methods for stochastic symmetric programming
- A projection descent method for solving variational inequalities
- Extended Lorentz cones and mixed complementarity problems
- Self-concordance and Decomposition-based Interior Point Methods for the Two-stage Stochastic Convex Optimization Problem
- Semidefinite optimization
- Primal-dual path-following algorithms for circular programming
- Elliptic cone optimization and primal–dual path-following algorithms
- The Jordan algebraic structure of the circular cone
- A STOCHASTIC APPROXIMATION ALGORITHM FOR STOCHASTIC SEMIDEFINITE PROGRAMMING
- Decomposition‐Based Interior Point Methods for Two‐Stage Stochastic Semidefinite Programming
- A log-barrier method with Benders decomposition for solving two-stage stochastic linear programs
This page was built for publication: Primal interior-point decomposition algorithms for two-stage stochastic extended second-order cone programming