Interior point methods of mathematical programming
The articles of this volume will be reviewed individually. Indexed articles: \textit{Jansen, Benjamin; Roos, Cornelis; Terlaky, Tamás}, Introduction to the theory of interior point methods, 3-34 [Zbl 0874.90128] \textit{Tsuchiya, Takashi}, Affine scaling algorithm, 35-82 [Zbl 0874.90132] \textit{Jansen, Benjamin; Roos, Cornelis; Terlaky, Tamás}, Target-following methods for linear programming, 83-124 [Zbl 0874.90129] \textit{Anstreicher, Kurt M.}, Potential reduction algorithms, 125-158 [Zbl 0876.90066] \textit{Mizuno, Shinji}, Infeasible-interior-point algorithms, 159-187 [Zbl 0874.90130] \textit{Andersen, Erling D.; Gondzio, Jacek; Mészáros, Csaba; Xu, Xiaojie}, Implementation of interior-point methods for large scale linear programs, 189-252 [Zbl 0874.90127] \textit{Jarre, Florian}, Interior-point methods for classes of convex programs, 255-296 [Zbl 0876.90073] \textit{Yoshise, Akiko}, Complementarity problems, 297-367 [Zbl 0874.90186] \textit{Ramana, Motakuri V.; Pardalos, Panos M.}, Semidefinite programming, 369-398 [Zbl 0874.90131] \textit{Shanno, David F.; Breitfeld, Mark G.; Simantiraki, Evangelia M.}, Implementing barrier methods for nonlinear programming, 399-414 [Zbl 0874.90174] \textit{Mitchell, John E.}, Interior point methods for combinatorial optimization, 417-466 [Zbl 0874.90163] \textit{Pardalos, Panos M.; Resende, Mauricio G. C.}, Interior point methods for global optimization, 467-500 [Zbl 0874.90172] \textit{Vannelli, Anthony; Kennings, Andrew; Chin, Paulina}, Interior point approaches for the VLSI placement problem, 501-528 [Zbl 0874.90196]
- Criss-cross methods: A fresh view on pivot algorithms
- Monotone variable-metric algorithm for linearly constrained nonlinear programming
- Symbiosis between linear algebra and optimization
- An interior point method for solving systems of linear equations and inequalities
- Interior-point methods
- How difficult is nonlinear optimization? A practical solver tuning approach, with illustrative results
- The flattened aggregate constraint homotopy method for nonlinear programming problems with many nonlinear constraints
- Examples of ill-behaved central paths in convex optimization
- Interior point methods for equilibrium problems
- The complexity of self-regular proximity based infeasible IPMs
- A numerical method for solving linear non-autonomous systems based on linear programming
- A primal-dual decomposition algorithm for multistage stochastic convex programming
- A primal-proximal heuristic applied to the French unit-commitment problem
- An interior point algorithm for global optimal solutions and KKT points
- A full-step interior-point algorithm for linear complementarity problem based on a simple function
- Interior Point Methods for Nonlinear Optimization
- A Relative Robust Optimization Approach for Full Factorial Scenario Design of Data Uncertainty and Ambiguity
- scientific article; zbMATH DE number 1047674 (Why is no real title available?)
- scientific article; zbMATH DE number 1069182 (Why is no real title available?)
- Image labeling based on graphical models using Wasserstein messages and geometric assignment
- scientific article; zbMATH DE number 194636 (Why is no real title available?)
- scientific article; zbMATH DE number 1889340 (Why is no real title available?)
- Computing maximum likelihood estimators of a log-concave density function
- scientific article; zbMATH DE number 4185410 (Why is no real title available?)
- An easy way to teach interior-point methods.
- Refinement of Lagrangian bounds in optimization problems
- Efficient use of quantum linear system algorithms in inexact infeasible IPMs for linear optimization
- Semidefinite programming approximation for a matrix optimization problem over an uncertain linear system
- Indefinite linearized augmented Lagrangian method for convex programming with linear inequality constraints
- A DRS-based path-following algorithm for linear programming
- An inexact interior-point relaxation method for linear optimization with a spectral preconditioner
- On the complexity of a combined homotopy interior method for convex programming
This page was built for publication: Interior point methods of mathematical programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1353361)
