A weighted-path-following method for linear optimization
From MaRDI portal
Recommendations
- A polynomial-time weighted path-following interior-point algorithm for linear optimization
- Weighted-path-following algorithm for linear programming
- A weighted-path-following method for the linear complementarity problem
- A new algorithm for solving self-dual linear optimization problems
- A weighted path-following method for linearly constrained convex programming
Cited in
(15)- A logarithmic barrier interior-point method based on majorant functions for second-order cone programming
- Interior-point algorithm for sufficient LCPs based on the technique of algebraically equivalent transformation
- A polynomial-time weighted path-following interior-point algorithm for linear optimization
- Primal interior-point decomposition algorithms for two-stage stochastic extended second-order cone programming
- Path-Following Methods for Linear Programming
- A logarithmic barrier approach for linear programming
- A full-Newton step interior-point method for monotone weighted linear complementarity problems
- scientific article; zbMATH DE number 6847407 (Why is no real title available?)
- A full Nesterov-Todd step feasible weighted primal-dual interior-point algorithm for symmetric optimization
- A modified damped Gauss-Newton method for non-monotone weighted linear complementarity problems
- The method of similar trajectories with branching according to parametric maximum of the auxiliary weight
- Weighted-path-following interior-point algorithm to monotone mixed linear complementarity problem
- A full-Newton step feasible weighted primal-dual interior point algorithm for monotone LCP
- Complexity analysis of a weighted-full-Newton step interior-point algorithm for P_*()-LCP
- Weighted-path-following algorithm for linear programming
This page was built for publication: A weighted-path-following method for linear optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5309541)
