Logarithmic-Barrier Decomposition Interior-Point Methods for Stochastic Linear Optimization in a Hilbert Space
From MaRDI portal
Publication:5107285
DOI10.1080/01630563.2019.1709499zbMath1441.90102OpenAlexW2999299455WikidataQ126397771 ScholiaQ126397771MaRDI QIDQ5107285
Publication date: 21 April 2020
Published in: Numerical Functional Analysis and Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/01630563.2019.1709499
Stochastic programming (90C15) Interior-point methods (90C51) Programming in abstract spaces (90C48) Semi-infinite programming (90C34) Hilbert subspaces (= operator ranges); complementation (Aronszajn, de Branges, etc.) (46C07)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Decomposition-based interior point methods for stochastic quadratic second-order cone programming
- A class of volumetric barrier decomposition algorithms for stochastic quadratic programming
- Stochastic programming. The state of the art. In honor of George B. Dantzig.
- Infinite-dimensional quadratic optimization: Interior-point methods and control applications
- Long-step path-following algorithm for convex quadratic programming problems in a Hilbert space
- A path following algorithm for infinite quadratic programming on a Hilbert space
- Volumetric barrier decomposition algorithms for stochastic quadratic second-order cone programming
- Global optimization in Hilbert space
- A Lagrangian dual method with self-concordant barriers for multi-stage stochastic convex programming
- Log-barrier method for two-stage quadratic stochastic programming
- Linear programming, complexity theory and elementary functional analysis
- Logarithmic barrier decomposition-based interior point methods for stochastic symmetric programming
- A Mathematical View of Interior-Point Methods in Convex Optimization
- Linear Programming and the Control of Diffusion Processes
- Kuhn–Tucker Conditions for a Convex Programming Problem in Banach Spaces Partially Ordered by Cone with Empty Interior
- An outer approximation algorithm for equilibrium problems in Hilbert spaces
- A class of polynomial volumetric barrier decomposition algorithms for stochastic semidefinite programming
- A Proximal-Type Method for Convex Vector Optimization Problem in Banach Spaces
- A Parametric Newton Method for Optimization Problems in Hilbert Spaces
- Necessary and Sufficient Conditions for Qualitative Properties of Infinite Dimensional Linear Programming Problems
- A Flexible Framework for Cubic Regularization Algorithms for Nonconvex Optimization in Function Space
- Conjugate Duality for Constrained Vector Optimization in Abstract Convex Frame
- 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: Logarithmic-Barrier Decomposition Interior-Point Methods for Stochastic Linear Optimization in a Hilbert Space
