scientific article; zbMATH DE number 1047679
From MaRDI portal
Publication:4347846
zbMath0874.90127MaRDI QIDQ4347846
Jacek Gondzio, Xiaojie Xu, Csaba Meszaros, Erling D. Andersen
Publication date: 11 November 1997
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items
A Schur complement approach to preconditioning sparse linear least-squares problems with some dense rows, The practical behavior of the homogeneous self-dual formulations in interior point methods, An interior-point approach for primal block-angular problems, Inexact constraint preconditioners for linear systems arising in interior point methods, Stopping criteria for inner iterations in inexact potential reduction methods: a computational study, Detecting ``dense columns in interior point methods for linear programs, An empirical evaluation of walk-and-round heuristics for mixed integer linear programs, Potential reduction algorithms for structured combinatorial optimization problems, New complexity analysis for primal-dual interior-point methods for self-scaled optimization problems, Complexity analysis of a full-{N}ewton step interior-point method for linear optimization, General-purpose preconditioning for regularized interior point methods, On sparse matrix orderings in interior point methods, The accuracy of interior-point methods based on kernel functions, Complexity analysis of interior point methods for linear programming based on a parameterized kernel function, A Numerical Implementation of an Interior Point Methods for Linear Programming Based on a New Kernel Function, An adaptive-step primal-dual interior point algorithm for linear optimization, On complexity analysis of the primal-dual interior-point method for semidefinite optimization problem based on a new proximity function, A new kind of simple kennel function yielding good iteration bounds for primal-dual interior-point methods, Matrix-free interior point method, Interior-point methods for linear optimization based on a kernel function with a trigonometric barrier term, Regularization techniques in interior point methods, Interior point methods 25 years later, Generic Primal-dual Interior Point Methods Based on a New Kernel Function, On the iterative solution of KKT systems in potential reduction software for large-scale quadratic problems, New complexity analysis of IIPMs for linear optimization based on a specific self-regular function, A massively parallel interior-point solver for LPs with generalized arrowhead structure, and applications to energy system models, A new primal-dual interior-point method for semidefinite optimization based on a parameterized kernel function, Interior Point Methods for Nonlinear Optimization, Influence of matrix reordering on the performance of iterative methods for solving linear systems arising from interior point methods for linear programming, Parallel interior-point solver for structured quadratic programs: Application to financial planning problems, An easy way to teach interior-point methods., Two direct methods in linear programming, A starting point strategy for nonlinear interior methods., On self-regular IPMs (with comments and rejoinder), Stabilization of Mehrotra's primal-dual algorithm and its implementation, An interior algorithm for nonlinear optimization that combines line search and trust region steps, Complexity analysis of interior-point methods for linear optimization based on some conditions on kernel function, Exploiting structure in parallel implementation of interior point methods for optimization, New complexity analysis of the primal-dual method for semidefinite optimization based on the Nesterov-Todd direction, Symbolic implementation of interior point method for linear programming problem, An interior-point algorithm for linear optimization based on a new barrier function, New method for determining search directions for interior-point algorithms in linear optimization, Solving linear systems in interior-point methods, A polynomial-time algorithm for linear optimization based on a new class of kernel functions, Primal-dual interior-point algorithms for second-order cone optimization based on kernel functions, An interior-point algorithm for linear programming with optimal selection of centering parameter and step size, Convergence analysis of the inexact infeasible interior-point method for linear optimization, Further development of multiple centrality correctors for interior point methods, Penalty algorithm based on conjugate gradient method for solving portfolio management problem, Implementation of interior-point methods for LP based on Krylov subspace iterative solvers with inner-iteration preconditioning, Warm start of the primal-dual method applied in the cutting-plane scheme, A class of polynomial primal-dual interior-point algorithms for semidefinite optimization, Utility based option pricing with proportional transaction costs and diversification problems: An interior-point optimization approach, Block preconditioners for linear systems in interior point methods for convex constrained optimization, A new class of polynomial primal-dual methods for linear and semidefinite optimization, Improving complexity of structured convex optimization problems using self-concordant barriers, Symbiosis between linear algebra and optimization, Steplengths in interior-point algorithms of quadratic programming, Solving large-scale linear programs by interior-point methods under the Matlab∗Environment†, Primal-dual interior-point algorithms for semidefinite optimization based on a simple kernel function, Pivot versus interior point methods: Pros and cons, Advances in design and implementation of optimization software, The Cholesky factorization in interior point methods
Uses Software
