scientific article; zbMATH DE number 7812867

DOI10.22049/cco.2022.27449.1266MaRDI QIDQ6149328

Unnamed Author, Baha M. Alzalg

Publication date: 5 March 2024

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

stochastic programmingconvex optimizationinterior-point methodspredictor-corrector methodsnonsymmetric programming

Mathematics Subject Classification ID

Convex programming (90C25) Nonlinear programming (90C30) Stochastic programming (90C15) Interior-point methods (90C51)

Cites Work

• Unnamed Item
• Decomposition-based interior point methods for stochastic quadratic second-order cone programming
• Copositive optimization -- recent developments and applications
• Homogeneous self-dual algorithms for stochastic second-order cone programming
• Conic formulation for \(l_p\)-norm optimization
• A class of volumetric barrier decomposition algorithms for stochastic quadratic programming
• Extension of primal-dual interior point algorithms to symmetric cones
• Second-order cone programming
• Parallel interior point schemes for solving multistage convex programming
• Volumetric barrier decomposition algorithms for stochastic quadratic second-order cone programming
• A Lagrangian dual method with self-concordant barriers for multi-stage stochastic convex programming
• Log-barrier method for two-stage quadratic stochastic programming
• Efficient solution of two-stage stochastic linear programs using interior point methods
• A primal barrier function phase I algorithm for nonsymmetric conic optimization problems
• Homogeneous self-dual algorithms for stochastic semidefinite programming
• An arc-search infeasible interior-point method for semidefinite optimization with the negative infinity neighborhood
• A primal-dual interior-point algorithm for nonsymmetric exponential-cone optimization
• On the algebraic structure of the copositive cone
• On valid inequalities for mixed integer \(p\)-order cone programming
• Logarithmic barrier decomposition-based interior point methods for stochastic symmetric programming
• The decompositions with respect to two core non-symmetric cones
• Metric subregularity and/or calmness of the normal cone mapping to the \(p\)-order conic constraint system
• A homogeneous interior-point algorithm for nonsymmetric convex conic optimization
• Extended Lorentz cones and mixed complementarity problems
• An infeasible interior-point algorithm for stochastic second-order cone optimization
• Hyperbolic programs, and their derivative relaxations
• Lectures on Modern Convex Optimization
• Scenario Formulation of Stochastic Linear Programs and the Homogeneous Self-Dual Interior-Point Method
• Polyhedral approximations inp-order cone programming
• A corrector–predictor path-following method for second-order cone optimization
• HOMOGENEOUS SELF-DUAL METHODS FOR SYMMETRIC CONES UNDER UNCERTAINTY
• Introduction to Stochastic Programming
• A class of polynomial volumetric barrier decomposition algorithms for stochastic semidefinite programming
• Scenarios and Policy Aggregation in Optimization Under Uncertainty
• Semidefinite optimization
• Formulating Two-Stage Stochastic Programs for Interior Point Methods
• Self-Scaled Barriers and Interior-Point Methods for Convex Programming
• A New Scenario Decomposition Method for Large-Scale Stochastic Optimization
• Towards non-symmetric conic optimization
• L-Shaped Linear Programs with Applications to Optimal Control and Stochastic Programming
• A log-barrier method with Benders decomposition for solving two-stage stochastic linear programs
• Generalization of primal-dual interior-point methods to convex optimization problems in conic form