The following pages link to (Q4347846):
Displayed 50 items.
- The practical behavior of the homogeneous self-dual formulations in interior point methods (Q302143) (← links)
- New complexity analysis for primal-dual interior-point methods for self-scaled optimization problems (Q383382) (← links)
- On sparse matrix orderings in interior point methods (Q402236) (← links)
- An adaptive-step primal-dual interior point algorithm for linear optimization (Q425813) (← links)
- On complexity analysis of the primal-dual interior-point method for semidefinite optimization problem based on a new proximity function (Q425872) (← links)
- Matrix-free interior point method (Q429480) (← links)
- Interior-point methods for linear optimization based on a kernel function with a trigonometric barrier term (Q432785) (← links)
- Regularization techniques in interior point methods (Q432801) (← links)
- Interior point methods 25 years later (Q439546) (← links)
- Influence of matrix reordering on the performance of iterative methods for solving linear systems arising from interior point methods for linear programming (Q522098) (← links)
- A new kind of simple kennel function yielding good iteration bounds for primal-dual interior-point methods (Q631897) (← links)
- An interior-point algorithm for linear optimization based on a new barrier function (Q720625) (← links)
- New method for determining search directions for interior-point algorithms in linear optimization (Q723503) (← links)
- The Cholesky factorization in interior point methods (Q815247) (← links)
- A polynomial-time algorithm for linear optimization based on a new class of kernel functions (Q1002187) (← links)
- Primal-dual interior-point algorithms for second-order cone optimization based on kernel functions (Q1012072) (← links)
- Convergence analysis of the inexact infeasible interior-point method for linear optimization (Q1028608) (← links)
- Further development of multiple centrality correctors for interior point methods (Q1029632) (← links)
- Penalty algorithm based on conjugate gradient method for solving portfolio management problem (Q1035576) (← links)
- Warm start of the primal-dual method applied in the cutting-plane scheme (Q1290656) (← links)
- Utility based option pricing with proportional transaction costs and diversification problems: An interior-point optimization approach (Q1294549) (← links)
- Steplengths in interior-point algorithms of quadratic programming (Q1306349) (← links)
- Potential reduction algorithms for structured combinatorial optimization problems (Q1373458) (← links)
- Symbiosis between linear algebra and optimization (Q1591197) (← links)
- Pivot versus interior point methods: Pros and cons (Q1598748) (← links)
- Advances in design and implementation of optimization software (Q1598765) (← links)
- A Schur complement approach to preconditioning sparse linear least-squares problems with some dense rows (Q1625762) (← links)
- Complexity analysis of a full-{N}ewton step interior-point method for linear optimization (Q1677554) (← links)
- A starting point strategy for nonlinear interior methods. (Q1767154) (← links)
- On self-regular IPMs (with comments and rejoinder) (Q1769946) (← links)
- Stabilization of Mehrotra's primal-dual algorithm and its implementation (Q1771347) (← links)
- A new class of polynomial primal-dual methods for linear and semidefinite optimization (Q1848379) (← links)
- Improving complexity of structured convex optimization problems using self-concordant barriers (Q1848383) (← links)
- The accuracy of interior-point methods based on kernel functions (Q1935292) (← links)
- An interior-point algorithm for linear programming with optimal selection of centering parameter and step size (Q2059175) (← links)
- Block preconditioners for linear systems in interior point methods for convex constrained optimization (Q2084581) (← links)
- A massively parallel interior-point solver for LPs with generalized arrowhead structure, and applications to energy system models (Q2239936) (← links)
- A new primal-dual interior-point method for semidefinite optimization based on a parameterized kernel function (Q2245692) (← links)
- Exploiting structure in parallel implementation of interior point methods for optimization (Q2271797) (← links)
- Implementation of interior-point methods for LP based on Krylov subspace iterative solvers with inner-iteration preconditioning (Q2322556) (← links)
- An empirical evaluation of walk-and-round heuristics for mixed integer linear programs (Q2393650) (← links)
- On the iterative solution of KKT systems in potential reduction software for large-scale quadratic problems (Q2457946) (← links)
- New complexity analysis of IIPMs for linear optimization based on a specific self-regular function (Q2462141) (← links)
- Parallel interior-point solver for structured quadratic programs: Application to financial planning problems (Q2480251) (← links)
- An interior algorithm for nonlinear optimization that combines line search and trust region steps (Q2492700) (← links)
- Complexity analysis of interior-point methods for linear optimization based on some conditions on kernel function (Q2493765) (← links)
- Primal-dual interior-point algorithms for semidefinite optimization based on a simple kernel function (Q2583508) (← links)
- An interior-point approach for primal block-angular problems (Q2643610) (← links)
- Inexact constraint preconditioners for linear systems arising in interior point methods (Q2643611) (← links)
- Stopping criteria for inner iterations in inexact potential reduction methods: a computational study (Q2643619) (← links)