Implementation of interior-point methods for LP based on Krylov subspace iterative solvers with inner-iteration preconditioning (Q2322556): Difference between revisions

Latest revision as of 00:21, 18 December 2024

scientific article

Language	Label	Description	Also known as
English	Implementation of interior-point methods for LP based on Krylov subspace iterative solvers with inner-iteration preconditioning	scientific article

Statements

instance of

scholarly article

0 references

title

Implementation of interior-point methods for LP based on Krylov subspace iterative solvers with inner-iteration preconditioning (English)

0 references

0 references

0 references

0 references

0 references

Computational Optimization and Applications

0 references

publication date

4 September 2019

0 references

full work available at URL

https://arxiv.org/abs/1604.07491

0 references

zbMATH Keywords

linear programming problems

0 references

interior-point methods

0 references

inner-iteration preconditioning

0 references

Krylov subspace methods

0 references

describes a project that uses

0 references

0 references

0 references

0 references

0 references

0 references

0 references

0 references

0 references

0 references

0 references

0 references

MaRDI publication profile

0 references

cites work

An implementation of Karmarkar's algorithm for linear programming

0 references

Convergence analysis of the inexact infeasible interior-point method for linear optimization

0 references

Preconditioning indefinite systems in interior point methods for large scale linear optimisation

0 references

Presolving in linear programming

0 references

Q4347846

0 references

Inexact constraint preconditioners for linear systems arising in interior point methods

0 references

Preconditioning indefinite systems in interior point methods for optimization

0 references

Accelerated projection methods for computing pseudoinverse solutions of systems of linear equations

0 references

An interior point method for quadratic programs based on conjugate projected gradients

0 references

Atomic Decomposition by Basis Pursuit

0 references

The N‐Step Iteration Procedures

0 references

Greville's method for preconditioning least squares problems

0 references

Implementation of interior-point methods for LP based on Krylov subspace iterative solvers with inner-iteration preconditioning

0 references

PCx: an interior-point code for linear programming

0 references

On mutual impact of numerical linear algebra and large-scale optimization with focus on interior point methods

0 references

The university of Florida sparse matrix collection

0 references

The Convergence of Linear Stationary Iterative Processes for Solving Singular Unstructured Systems of Linear Equations

0 references

Benchmarking optimization software with performance profiles.

0 references

MA57---a code for the solution of sparse symmetric definite and indefinite systems

0 references

Interior-Point Methods for Massive Support Vector Machines

0 references

Solving symmetric indefinite systems in an interior-point method for linear programming

0 references

A QMR-based interior-point algorithm for solving linear programs

0 references

Convergence of a Class of Inexact Interior-Point Algorithms for Linear Programs

0 references

On projected newton barrier methods for linear programming and an equivalence to Karmarkar’s projective method

0 references

HOPDM (version 2. 12) -- a fast LP solver based on a primal-dual interior point method

0 references

Multiple centrality corrections in a primal-dual method for linear programming

0 references

Presolve Analysis of Linear Programs Prior to Applying an Interior Point Method

0 references

Interior point methods 25 years later

0 references

Matrix-free interior point method

0 references

Q4355914

0 references

Graph Implementations for Nonsmooth Convex Programs

0 references

GMRES Methods for Least Squares Problems

0 references

Methods of conjugate gradients for solving linear systems

0 references

A study of preconditioners for network interior point methods

0 references

Computational results of an interior point algorithm for large scale linear programming

0 references

A polynomial-time algorithm for a class of linear complementarity problems

0 references

Convergence Analysis of Inexact Infeasible-Interior-Point Algorithms for Solving Linear Programming Problems

0 references

On Implementing Mehrotra’s Predictor–Corrector Interior-Point Method for Linear Programming

0 references

Feature Article—Interior Point Methods for Linear Programming: Computational State of the Art

0 references

Implementations of Affine Scaling Methods: Approximate Solutions of Systems of Linear Equations Using Preconditioned Conjugate Gradient Methods

0 references

On the Implementation of a Primal-Dual Interior Point Method

0 references

Convergence Conditions and Krylov Subspace--Based Corrections for Primal-Dual Interior-Point Method

0 references

Q3125523

0 references

Interior path following primal-dual algorithms. I: Linear programming

0 references

Uniform Boundedness of a Preconditioned Normal Matrix Used in Interior-Point Methods

0 references

Inner-Iteration Krylov Subspace Methods for Least Squares Problems

0 references

Convergence of Inner-Iteration GMRES Methods for Rank-Deficient Least Squares Problems

0 references

A new class of preconditioners for large-scale linear systems from interior point methods for linear programming

0 references

Solution of Sparse Indefinite Systems of Linear Equations

0 references

Q4953319

0 references

A Preconditioner for Linear Systems Arising From Interior Point Optimization Methods

0 references

An Implementation of the Dual Affine Scaling Algorithm for Minimum-Cost Flow on Bipartite Uncapacitated Networks

0 references

Q4414854

0 references

GMRES: A Generalized Minimal Residual Algorithm for Solving Nonsymmetric Linear Systems

0 references

Using SeDuMi 1.02, A Matlab toolbox for optimization over symmetric cones

0 references

Q3804467

0 references

SDPT3 — A Matlab software package for semidefinite programming, Version 1.3

0 references

Solving semidefinite-quadratic-linear programs using SDPT3

0 references

Adaptive use of iterative methods in predictor-corrector interior point methods for linear programming

0 references

Q5691079

0 references

Modified Cholesky Factorizations in Interior-Point Algorithms for Linear Programming

0 references

On the Convergence of a Class of Infeasible Interior-Point Methods for the Horizontal Linear Complementarity Problem

0 references

Solving large-scale linear programs by interior-point methods under the Matlab∗Environment†

0 references

Identifiers

zbMATH Open document ID

1427.90289

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

0 references

0 references

10.1007/S10589-019-00103-Y

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:2322556

@@ Property / DOI @@
-.1007/s10589-019-00103-y
@@ Property / DOI: 10.1007/s10589-019-00103-y / rank @@
-Normal rank
@@ Property / DOI @@
+.1007/S10589-019-00103-Y
@@ Property / DOI: 10.1007/S10589-019-00103-Y / rank @@
+Normal rank