A corrector-predictor interior-point method with new search direction for linear optimization
From MaRDI portal
Publication:2201317
DOI10.1007/s10100-019-00622-3OpenAlexW2946830141MaRDI QIDQ2201317
Tibor Illés, Behrouz Kheirfam, Zsolt Darvay, Petra Renáta Rigó
Publication date: 29 September 2020
Published in: CEJOR. Central European Journal of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10100-019-00622-3
Linear programming (90C05) Interior-point methods (90C51) Operations research and management science (90Bxx)
Related Items (6)
A new corrector-predictor interior-point method for symmetric cone optimization ⋮ Corrector-predictor interior-point method with new search direction for semidefinite optimization ⋮ A new long-step interior point algorithm for linear programming based on the algebraic equivalent transformation ⋮ Operations research in Hungary: VOCAL 2018 ⋮ Feasible Corrector-Predictor Interior-Point Algorithm for $P_{*} (\kappa)$-Linear Complementarity Problems Based on a New Search Direction ⋮ Predictor-corrector interior-point algorithm for \(P_*(\kappa)\)-linear complementarity problems based on a new type of algebraic equivalent transformation technique
Cites Work
- Weighted-path-following interior-point algorithm to monotone mixed linear complementarity problem
- An infeasible interior point method for the monotone SDLCP based on a transformation of the central path
- A new polynomial-time algorithm for linear programming
- A Mizuno-Todd-Ye type predictor-corrector algorithm for sufficient linear complementarity problems
- Complexity analysis and numerical implementation of a short-step primal-dual algorithm for linear complementarity problems
- A polynomial path-following interior point algorithm for general linear complementarity problems
- A unified approach to interior point algorithms for linear complementarity problems: A summary
- Predictor-corrector algorithm for solving \(P_ *(\kappa)\)-matrix LCP from arbitrary positive starting points
- Pivot versus interior point methods: Pros and cons
- Complexity analysis of a full-{N}ewton step interior-point method for linear optimization
- The Mizuno-Todd-Ye algorithm in a larger neighborhood of the central path
- A predictor-corrector interior-point algorithm for \(P_\ast (\kappa )\)-horizontal linear complementarity problem
- A corrector-predictor path-following method for convex quadratic symmetric cone optimization
- Polynomial interior-point algorithm for \(P_\ast(\kappa)\) horizontal linear complementarity problems
- A full Nesterov–Todd step infeasible-interior-point algorithm for CartesianP*(κ) horizontal linear complementarity problems over symmetric cones
- A NEW POLYNOMIAL INTERIOR-POINT ALGORITHM FOR THE MONOTONE LINEAR COMPLEMENTARITY PROBLEM OVER SYMMETRIC CONES WITH FULL NT-STEPS
- A corrector–predictor path-following method for second-order cone optimization
- An infeasible full-NT step IPM for horizontal linear complementarity problem over Cartesian product of symmetric cones
- A Corrector-Predictor Interior-Point Algorithm for P∗(κ)-HLCPs Over Cartesian Product of Symmetric Cones
- Unified Analysis of Kernel-Based Interior-Point Methods for $P_*(\kappa)$-Linear Complementarity Problems
- On the Implementation of a Primal-Dual Interior Point Method
- On Adaptive-Step Primal-Dual Interior-Point Algorithms for Linear Programming
- An O(√nL)-Iteration Homogeneous and Self-Dual Linear Programming Algorithm
- Interior Point Methods for Sufficient Horizontal LCP in a Wide Neighborhood of the Central Path with Best Known Iteration Complexity
- Computational aspects of simplex and MBU-simplex algorithms using different anti-cycling pivot rules
- An easy way to teach interior-point methods.
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: A corrector-predictor interior-point method with new search direction for linear optimization
