A computational study of the homogeneous algorithm for large-scale convex optimization
From MaRDI portal
Publication:1273428
DOI10.1023/A:1018369223322zbMath0914.90212OpenAlexW1597615673MaRDI QIDQ1273428
Publication date: 9 March 1999
Published in: Computational Optimization and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1023/a:1018369223322
interior-point algorithmssmooth convex optimizationmonotone complementarity problemhomogeneous and self-dual modellarge-scale sparse convex optimizationsingle phase interior-point type method
Convex programming (90C25) Large-scale problems in mathematical programming (90C06) Quadratic programming (90C20)
Related Items (16)
The practical behavior of the homogeneous self-dual formulations in interior point methods ⋮ A modified homogeneous potential reduction algorithm for solving the monotone semidefinite linear complementarity problem ⋮ Interactions between nonlinear programming and modeling systems ⋮ A predictor-corrector algorithm with multiple corrections for convex quadratic programming ⋮ On the behavior of Lagrange multipliers in convex and nonconvex infeasible interior point methods ⋮ On the iterative solution of KKT systems in potential reduction software for large-scale quadratic problems ⋮ A homogeneous model for monotone mixed horizontal linear complementarity problems ⋮ Interior Point Methods for Nonlinear Optimization ⋮ An adaptive infeasible interior-point algorithm with full-Newton step for linear optimization ⋮ A variational principle for computing nonequilibrium fluxes and potentials in genome-scale biochemical networks ⋮ Integrating design and production planning considerations in multi-bay manufacturing facility layout ⋮ On implementation of a self-dual embedding method for convex programming ⋮ A tutorial on geometric programming ⋮ A primal-dual decomposition algorithm for multistage stochastic convex programming ⋮ Compressed sensing in the spherical near-field to far-field transformation ⋮ An empirical evaluation of a walk-relax-round heuristic for mixed integer convex programs
Uses Software
This page was built for publication: A computational study of the homogeneous algorithm for large-scale convex optimization
