A corrector-predictor interior-point method with new search direction for linear optimization
From MaRDI portal
Publication:2201317
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
Cites work
- scientific article; zbMATH DE number 4199964 (Why is no real title available?)
- scientific article; zbMATH DE number 3972641 (Why is no real title available?)
- scientific article; zbMATH DE number 4041641 (Why is no real title available?)
- scientific article; zbMATH DE number 53115 (Why is no real title available?)
- scientific article; zbMATH DE number 4126998 (Why is no real title available?)
- scientific article; zbMATH DE number 729680 (Why is no real title available?)
- scientific article; zbMATH DE number 1017028 (Why is no real title available?)
- scientific article; zbMATH DE number 1047681 (Why is no real title available?)
- scientific article; zbMATH DE number 1131479 (Why is no real title available?)
- scientific article; zbMATH DE number 1862745 (Why is no real title available?)
- scientific article; zbMATH DE number 964349 (Why is no real title available?)
- A Mizuno-Todd-Ye type predictor-corrector algorithm for sufficient linear complementarity problems
- A corrector-predictor interior-point algorithm for \(P_\ast(\kappa)\)-HLCPs over Cartesian product of symmetric cones
- A corrector-predictor path-following method for convex quadratic symmetric cone optimization
- A corrector-predictor path-following method for second-order cone optimization
- A full Nesterov-Todd step infeasible-interior-point algorithm for Cartesian \(P_\ast(\kappa)\) horizontal linear complementarity problems over symmetric cones
- A new algorithm for solving self-dual linear optimization problems
- A new polynomial interior-point algorithm for the monotone linear complementarity problem over symmetric cones with full NT-steps
- A new polynomial-time algorithm for linear programming
- A new predictor-collector algorithm for linear programming
- A polynomial path-following interior point algorithm for general linear complementarity problems
- A predictor-corrector algorithm for linearly constrained convex optimization
- A predictor-corrector interior-point algorithm for \(P_\ast (\kappa )\)-horizontal linear complementarity problem
- A unified approach to interior point algorithms for linear complementarity problems: A summary
- An O(√nL)-Iteration Homogeneous and Self-Dual Linear Programming Algorithm
- An easy way to teach interior-point methods.
- An infeasible full-NT step IPM for \(P_\ast(\kappa)\) horizontal linear complementarity problem over Cartesian product of symmetric cones
- An infeasible interior point method for the monotone SDLCP based on a transformation of the central path
- Complexity analysis and numerical implementation of a short-step primal-dual algorithm for linear complementarity problems
- Complexity analysis of a full-{N}ewton step interior-point method for linear optimization
- Computational aspects of simplex and MBU-simplex algorithms using different anti-cycling pivot rules
- Interior point methods for sufficient horizontal LCP in a wide neighborhood of the central path with best known iteration complexity
- New interior point algorithms in linear programming
- On Adaptive-Step Primal-Dual Interior-Point Algorithms for Linear Programming
- On the Implementation of a Primal-Dual Interior Point Method
- Pivot versus interior point methods: Pros and cons
- Polynomial interior point algorithms for general linear complementarity problems
- Polynomial interior-point algorithm for \(P_\ast(\kappa)\) horizontal linear complementarity problems
- Predictor-corrector algorithm for solving \(P_ *(\kappa)\)-matrix LCP from arbitrary positive starting points
- The Mizuno-Todd-Ye algorithm in a larger neighborhood of the central path
- Unified analysis of kernel-based interior-point methods for \(P_*(\kappa)\)-linear complementarity problems
- Weighted-path-following interior-point algorithm to monotone mixed linear complementarity problem
Cited in
(14)- A new corrector-predictor interior-point method for symmetric cone 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 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
- Large-step predictor-corrector interior point method for sufficient linear complementarity problems based on the algebraic equivalent transformation
- Feasible corrector-predictor interior-point algorithm for \(P_* (\kappa)\)-linear complementarity problems based on a new search direction
- scientific article; zbMATH DE number 822140 (Why is no real title available?)
- A new long-step interior point algorithm for linear programming based on the algebraic equivalent transformation
- Adaptive use of iterative methods in predictor-corrector interior point methods for linear programming
- A new Ai-Zhang type interior point algorithm for sufficient linear complementarity problems
- Corrector-predictor interior-point method with new search direction for semidefinite optimization
- A predictor-corrector algorithm combined conjugate gradient with homotopy interior point for general nonlinear programming
- Overview of Hungarian operations research based on the VOCAL 2022 conference
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)
