An easy way to teach interior-point methods.
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 1047674
- A Survey of the Implications of the Behavior of the Central Path for the Duality Theory of Linear Programming
- The theory of linear programming:skew symmetric self-dual problems and the central path*
- scientific article; zbMATH DE number 778139
- scientific article; zbMATH DE number 1064582
Cites work
- A general parametric analysis approach and its implication to sensitivity analysis in interior point methods
- A new polynomial-time algorithm for linear programming
- An Implementation of a Primal-Dual Interior Point Method for Linear Programming
- An O(√nL)-Iteration Homogeneous and Self-Dual Linear Programming Algorithm
- Finding an interior point in the optimal face of linear programs
- scientific article; zbMATH DE number 3121281 (Why is no real title available?)
- scientific article; zbMATH DE number 3121284 (Why is no real title available?)
- scientific article; zbMATH DE number 3972641 (Why is no real title available?)
- scientific article; zbMATH DE number 1187124 (Why is no real title available?)
- scientific article; zbMATH DE number 4126998 (Why is no real title available?)
- scientific article; zbMATH DE number 590363 (Why is no real title available?)
- scientific article; zbMATH DE number 1017028 (Why is no real title available?)
- scientific article; zbMATH DE number 1047679 (Why is no real title available?)
- scientific article; zbMATH DE number 1131479 (Why is no real title available?)
- scientific article; zbMATH DE number 1182578 (Why is no real title available?)
- scientific article; zbMATH DE number 3307153 (Why is no real title available?)
- scientific article; zbMATH DE number 964349 (Why is no real title available?)
- Initialization in semidefinite programming via a self-dual skew-symmetric embedding
- Interior point methods of mathematical programming
- New complexity analysis of the primal-dual Newton method for linear optimization
- On homogeneous interrior-point algorithms for semidefinite programming
- On the finite convergence of interior-point algorithms for linear programming
- On the Implementation of a Primal-Dual Interior Point Method
- Self-Scaled Barriers and Interior-Point Methods for Convex Programming
- Semidefinite Programming
- Sensitivity analysis in linear programming: Just be careful!
- The theory of linear programming:skew symmetric self-dual problems and the central path*
Cited in
(11)- Pivot versus interior point methods: Pros and cons
- Complexity analysis of a full-{N}ewton step interior-point method for linear optimization
- A corrector-predictor interior-point method with new search direction for linear optimization
- A new wide neighborhood primal-dual second-order corrector algorithm for linear optimization
- A still simpler way of introducing interior-point method for linear programming
- A new primal-dual predictor-corrector interior-point method for linear programming based on a wide neighbourhood
- Interior Point Methods for Nonlinear Optimization
- Calmness of partially perturbed linear systems with an application to the central path
- The theory of linear programming:skew symmetric self-dual problems and the central path*
- Multiple faces of optimization. A tribute to Tamás Terlaky on his 70th birthday
- New method for determining search directions for interior-point algorithms in linear optimization
This page was built for publication: An easy way to teach interior-point methods.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5932020)
