The practical behavior of the homogeneous self-dual formulations in interior point methods
From MaRDI portal
Publication:302143
DOI10.1007/s10100-013-0336-1zbMath1339.90333OpenAlexW2130114417MaRDI QIDQ302143
Publication date: 4 July 2016
Published in: CEJOR. Central European Journal of Operations Research (Search for Journal in Brave)
Full work available at URL: http://eprints.sztaki.hu/8540/
interior point methodsprogrammingconvex quadratically constrained quadratichomogeneous self-dual embedding
Related Items
Effective and efficient Grassfinch kernel for SVM classification and its application to recognition based on image set ⋮ Editorial. CEJOR special issue of Croatian Operational Research Society ⋮ Editorial ⋮ Operator Splitting for a Homogeneous Embedding of the Linear Complementarity Problem
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Regularization techniques in interior point methods
- Feasibility issues in a primal-dual interior-point method for linear programming
- The Cholesky factorization in interior point methods
- A computational study of the homogeneous algorithm for large-scale convex optimization
- A primal-dual infeasible-interior-point algorithm for linear programming
- Polynomiality of infeasible-interior-point algorithms for linear programming
- Advanced preprocessing techniques for linear and quadratic programming
- Infeasible-start primal-dual methods and infeasibility detectors for nonlinear programming problems
- On a homogeneous algorithm for the monotone complementarity problem
- Multiple centrality corrections in a primal-dual method for linear programming
- A generalized homogeneous and self-dual algorithm for linear programming
- A simplified homogeneous and self-dual linear programming algorithm and its implementation
- Solving quadratically constrained convex optimization problems with an interior-point method
- On the implementation of interior point methods for dual-core platforms
- On Numerical Issues of Interior Point Methods
- A duality theorem for non-linear programming
- On Implementing Mehrotra’s Predictor–Corrector Interior-Point Method for Linear Programming
- Feature Article—Interior Point Methods for Linear Programming: Computational State of the Art
- An O(√nL)-Iteration Homogeneous and Self-Dual Linear Programming Algorithm
- On free variables in interior point methods
- The BPMPD interior point solver for convex quadratic problems
- Modified Cholesky Factorizations in Interior-Point Algorithms for Linear Programming
- Symmetric Quasidefinite Matrices
- The theory of linear programming:skew symmetric self-dual problems and the central path*
- On two homogeneous self-dual approaches to linear programming and its extensions.
