A new algorithm for solving self-dual linear optimization problems
From MaRDI portal
Recommendations
- The modified interior point algorithm for linear optimization
- Self-regular functions and new search directions for linear and semidefinite optimization
- New interior point algorithms in linear programming
- Interior-point algorithm for linear optimization based on a new search direction
- A PRIMAL-DUAL INTERIOR-POINT ALGORITHM BASED ON A NEW KERNEL FUNCTION
Cited in
(21)- A path following interior-point method for linear complementarity problems over circular cones
- Complexity analysis of a full-{N}ewton step interior-point method for linear optimization
- A generalized direction in interior point method for monotone linear complementarity problems
- A new full-Newton step interior-point method for \(P_*(\kappa)\)-LCP based on a positive-asymptotic kernel function
- A corrector-predictor interior-point method with new search direction for linear optimization
- An infeasible primal-dual interior point algorithm for linear programs based on logarithmic equivalent transformation
- A new polynomial interior-point algorithm for the monotone linear complementarity problem over symmetric cones with full NT-steps
- A self-regular Newton based algorithm for linear optimization
- On implementation of a self-dual embedding method for convex programming
- New interior-point algorithm for symmetric optimization based on a positive-asymptotic barrier function
- scientific article; zbMATH DE number 851571 (Why is no real title available?)
- Feasible corrector-predictor interior-point algorithm for \(P_* (\kappa)\)-linear complementarity problems based on a new search direction
- scientific article; zbMATH DE number 3894831 (Why is no real title available?)
- A weighted-path-following method for linear optimization
- A primal-dual interior-point algorithm for symmetric optimization based on a new method for finding search directions
- Large-step predictor-corrector interior point method for sufficient linear complementarity problems based on the algebraic equivalent transformation
- Large-step algorithm for linear complementarity problem with new search direction
- New method for determining search directions for interior-point algorithms in linear optimization
- An improved search direction based on algebraic equivalent transformation technique for convex quadratic optimization
- Interior-point algorithm for sufficient LCPs based on the technique of algebraically equivalent transformation
- Complexity analysis and numerical implementation of a short-step primal-dual algorithm for linear complementarity problems
This page was built for publication: A new algorithm for solving self-dual linear optimization problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5309527)
