Publication:4347846
From MaRDI portal
zbMath0874.90127MaRDI QIDQ4347846
Jacek Gondzio, Erling D. Andersen, Csaba Meszaros, Xiaojie Xu
Publication date: 11 November 1997
Related Items
An easy way to teach interior-point methods., Two direct methods in linear programming, New complexity analysis of the primal-dual method for semidefinite optimization based on the Nesterov-Todd direction, Solving linear systems in interior-point methods, The Cholesky factorization 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, 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, Warm start of the primal-dual method applied in the cutting-plane scheme, Utility based option pricing with proportional transaction costs and diversification problems: An interior-point optimization approach, Steplengths in interior-point algorithms of quadratic programming, Potential reduction algorithms for structured combinatorial optimization problems, Symbiosis between linear algebra and optimization, Pivot versus interior point methods: Pros and cons, Advances in design and implementation of optimization software, 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, A new class of polynomial primal-dual methods for linear and semidefinite optimization, Improving complexity of structured convex optimization problems using self-concordant barriers, Exploiting structure in parallel implementation of interior point methods for optimization, 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, Parallel interior-point solver for structured quadratic programs: Application to financial planning problems, 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, Primal-dual interior-point algorithms for semidefinite optimization based on a simple kernel function, 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, Symbolic implementation of interior point method for linear programming problem, A class of polynomial primal-dual interior-point algorithms for semidefinite optimization, Generic Primal-dual Interior Point Methods Based on a New Kernel Function, Interior Point Methods for Nonlinear Optimization, Solving large-scale linear programs by interior-point methods under the Matlab∗Environment†
Uses Software
