A corrector-predictor interior-point method with new search direction for linear optimization

DOI10.1007/S10100-019-00622-3OpenAlexW2946830141MaRDI QIDQ2201317FDOQ2201317

Authors: Zsolt Darvay, Tibor Illés, Behrouz Kheirfam, 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

Recommendations

• Corrector-predictor interior-point method with new search direction for semidefinite optimization
• Interior-point algorithm for linear optimization based on a new search direction
• New method for determining search directions for interior-point algorithms in linear optimization
• A new predictor-corrector infeasible interior-point algorithm for linear optimization in a wide neighborhood
• A predictor-corrector algorithm for linear optimization based on a modified Newton direction
• scientific article; zbMATH DE number 822140
• A Mehrotra type predictor-corrector interior-point algorithm for linear programming
• Feasible corrector-predictor interior-point algorithm for \(P_* (\kappa)\)-linear complementarity problems based on a new search direction
• A predictor-corrector infeasible-interior-point algorithm for linear programming
• On Implementing Mehrotra’s Predictor–Corrector Interior-Point Method for Linear Programming

zbMATH Keywords

polynomial complexitylinear optimizationcorrector-predictor methodsnew search directions

Mathematics Subject Classification ID

Linear programming (90C05) Interior-point methods (90C51) Operations research and management science (90Bxx)

Cites Work

• On the Implementation of a Primal-Dual Interior Point Method
• Title not available (Why is that?)
• Title not available (Why is that?)
• A new polynomial-time algorithm for linear programming
• A unified approach to interior point algorithms for linear complementarity problems: A summary
• A predictor-corrector interior-point algorithm for \(P_\ast (\kappa )\)-horizontal linear complementarity problem
• Unified analysis of kernel-based interior-point methods for \(P_*(\kappa)\)-linear complementarity problems
• Title not available (Why is that?)
• On Adaptive-Step Primal-Dual Interior-Point Algorithms for Linear Programming
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• An O(√nL)-Iteration Homogeneous and Self-Dual Linear Programming Algorithm
• Polynomial interior point algorithms for general linear complementarity problems
• Title not available (Why is that?)
• Interior point methods for sufficient horizontal LCP in a wide neighborhood of the central path with best known iteration complexity
• A polynomial path-following interior point algorithm for general linear complementarity problems
• Polynomial interior-point algorithm for \(P_\ast(\kappa)\) horizontal linear complementarity problems
• New interior point algorithms in linear programming
• Title not available (Why is that?)
• An easy way to teach interior-point methods.
• A corrector-predictor path-following method for convex quadratic symmetric cone optimization
• Title not available (Why is that?)
• Weighted-path-following interior-point algorithm to monotone mixed linear complementarity problem
• Complexity analysis and numerical implementation of a short-step primal-dual algorithm for linear complementarity problems
• The Mizuno-Todd-Ye algorithm in a larger neighborhood of the central path
• Predictor-corrector algorithm for solving \(P_ *(\kappa)\)-matrix LCP from arbitrary positive starting points
• Title not available (Why is that?)
• A full Nesterov-Todd step infeasible-interior-point algorithm for Cartesian \(P_\ast(\kappa)\) 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
• Pivot versus interior point methods: Pros and cons
• Computational aspects of simplex and MBU-simplex algorithms using different anti-cycling pivot rules
• A Mizuno-Todd-Ye type predictor-corrector algorithm for sufficient linear complementarity problems
• Complexity analysis of a full-{N}ewton step interior-point method for linear optimization
• A new algorithm for solving self-dual linear optimization problems
• An infeasible interior point method for the monotone SDLCP based on a transformation of the central path
• A predictor-corrector algorithm for linearly constrained convex optimization
• Title not available (Why is that?)
• An infeasible full-NT step IPM for \(P_\ast(\kappa)\) horizontal linear complementarity problem over Cartesian product of symmetric cones
• A corrector-predictor interior-point algorithm for \(P_\ast(\kappa)\)-HLCPs over Cartesian product of symmetric cones
• A new predictor-collector algorithm for linear programming
• A corrector-predictor path-following method for second-order cone optimization

Cited In (14)

• A predictor-corrector algorithm for linear optimization based on a modified Newton direction
• The Mehrotra Predictor-Corrector Interior-Point Method As a Perturbed Composite Newton Method
• Operations research in Hungary: VOCAL 2018
• A new Ai-Zhang type interior point algorithm for sufficient linear complementarity problems
• Adaptive use of iterative methods in predictor-corrector interior point methods for linear programming
• Corrector-predictor interior-point method with new search direction for semidefinite optimization
• Predictor-corrector interior-point algorithm for \(P_*(\kappa)\)-linear complementarity problems based on a new type of algebraic equivalent transformation technique
• A predictor-corrector algorithm combined conjugate gradient with homotopy interior point for general nonlinear programming
• Title not available (Why is that?)
• Feasible corrector-predictor interior-point algorithm for \(P_* (\kappa)\)-linear complementarity problems based on a new search direction
• Large-step predictor-corrector interior point method for sufficient linear complementarity problems based on the algebraic equivalent transformation
• Overview of Hungarian operations research based on the VOCAL 2022 conference
• A new corrector-predictor interior-point method for symmetric cone optimization
• A new long-step interior point algorithm for linear programming based on the algebraic equivalent transformation

This page was built for publication: A corrector-predictor interior-point method with new search direction for linear optimization

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2201317)