New method for determining search directions for interior-point algorithms in linear optimization
From MaRDI portal
Publication:723503
DOI10.1007/s11590-017-1171-4zbMath1421.90080OpenAlexW2736530414MaRDI QIDQ723503
Zsolt Darvay, Petra-Renáta Takács
Publication date: 31 July 2018
Published in: Optimization Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11590-017-1171-4
Newton's methodlinear optimizationpolynomial complexityinterior-point algorithmalgebraic equivalent transformationsearch direction
Related Items (12)
Projected orthogonal vectors in two-dimensional search interior point algorithms for linear programming ⋮ Interior-point algorithm for linear programming based on a new descent direction ⋮ Corrector-predictor interior-point method with new search direction for semidefinite optimization ⋮ A class of new search directions for full-NT step feasible interior point method in semidefinite optimization ⋮ A new search direction for full-Newton step infeasible interior-point method in linear optimization ⋮ A New Search Direction for Full-Newton Step Interior-Point Method in P*(κ)-HLCP ⋮ A new full-NT step interior-point method for circular cone optimization ⋮ A primal-dual interior-point algorithm for symmetric optimization based on a new method for finding search directions ⋮ An extension for identifying search directions for interior-point methods in linear optimization ⋮ A new full-Newton step interior-point method for \(P_*(\kappa)\)-LCP based on a positive-asymptotic kernel function ⋮ Predictor-corrector interior-point algorithm for \(P_*(\kappa)\)-linear complementarity problems based on a new type of algebraic equivalent transformation technique ⋮ Path-following interior-point algorithm for monotone linear complementarity problems
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A polynomial interior-point algorithm for monotone linear complementarity problems
- A full-Newton step interior-point algorithm based on modified Newton direction
- A new primal-dual path-following method for convex quadratic programming
- Some generalizations of the criss-cross method for the linear complementarity problem of oriented matroids
- A primal-dual interior-point algorithm for second-order cone optimization with full Nesterov-Todd step
- Complexity analysis of an interior-point algorithm for linear optimization based on a new proximity function
- A new polynomial-time algorithm for linear programming
- 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 new primal-dual path-following interior-point algorithm for semidefinite optimization
- EP theorem for dual 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
- A superlinearly convergent predictor-corrector method for degenerate LCP in a wide neighborhood of the central path with \(O(\sqrt nL)\)-iteration complexity
- A new full Nesterov-Todd step primal-dual path-following interior-point algorithm for symmetric optimization
- A predictor-corrector interior-point algorithm for \(P_\ast (\kappa )\)-horizontal linear complementarity problem
- Polynomial interior-point algorithm for \(P_\ast(\kappa)\) horizontal linear complementarity problems
- A NEW POLYNOMIAL INTERIOR-POINT ALGORITHM FOR THE MONOTONE LINEAR COMPLEMENTARITY PROBLEM OVER SYMMETRIC CONES WITH FULL NT-STEPS
- A New Class of Large Neighborhood Path-Following Interior Point Algorithms for Semidefinite Optimization with $O(\sqrt{n}\log\frac{\mathrm{Tr}(X^0S^0)}{\epsilon})$ Iteration Complexity
- A new primal-dual path-following interior-point algorithm for linearly constrained convex optimization
- A convergent criss-cross method
- On the Implementation of a Primal-Dual Interior Point Method
- An O(√nL)-Iteration Homogeneous and Self-Dual Linear Programming Algorithm
- A Large-Step Infeasible-Interior-Point Method for the P*-Matrix LCP
- A New Efficient Large-Update Primal-Dual Interior-Point Method Based on a Finite Barrier
- A Comparative Study of Kernel Functions for Primal-Dual Interior-Point Algorithms in Linear Optimization
- The theory of linear programming:skew symmetric self-dual problems and the central path*
- An O$(\sqrtn L)$ Iteration Primal-dual Path-following Method, Based on Wide Neighborhoods and Large Updates, for Monotone LCP
- An easy way to teach interior-point methods.
This page was built for publication: New method for determining search directions for interior-point algorithms in linear optimization
