scientific article; zbMATH DE number 4199965

zbMATH Open0726.90057MaRDI QIDQ3348701FDOQ3348701

Authors: Thomas F. Coleman, Yuying Li 

Publication date: 1990

Title of this publication is not available (Why is that?)

Recommendations

• scientific article; zbMATH DE number 4131946
• scientific article; zbMATH DE number 679874
• New algorithms for linear programming
• A new polynomial-time algorithm for linear programming
• scientific article; zbMATH DE number 4037611

zbMATH Keywords

finite lower and upper boundsquadratically-convergent algorithm

Mathematics Subject Classification ID

Linear programming (90C05) Large-scale problems in mathematical programming (90C06) Computational methods for problems pertaining to operations research and mathematical programming (90-08)

Cited In (13)

• A roof linearization algorithm to obtain a tight upper bound for integer nonseparable quadratic programming
• A Path-Following Algorithm for Linear Programming Using Quadratic and Logarithmic Penalty Functions
• Title not available (Why is that?)
• On quadratic and \(O(\sqrt{n}L)\) convergence of a predictor-corrector algorithm for LCP
• Concise algorithm for linear programs in \texttt{Matlab}: monotonic convergence, basic variables, boundedness
• Title not available (Why is that?)
• The `Idiot' crash quadratic penalty algorithm for linear programming and its application to linearizations of quadratic assignment problems
• Title not available (Why is that?)
• A Global and Quadratically Convergent Method for Linear $l_\infty $ Problems
• The bound improving sequence algorithm
• Method for sequential activation of limitations in linear programming
• On the convergence of interior-reflective Newton methods for nonlinear minimization subject to bounds
• A proportioning based algorithm with rate of convergence for bound constrained quadratic programming

Uses Software

• MINOS

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3348701)