Barrier Functions and Interior-Point Algorithms for Linear Programming With Zero-, One-, or Two-Sided Bounds on the Variables

Mathematics of Operations Research - United States
doi 10.1287/moor.20.2.415
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Institute for Operations Research and the Management Sciences (INFORMS)

Related search

An Optimal Basis Identification Technique for Interior-Point Linear Programming Algorithms

1990English

An Interior Point Method for Linear Programming Based on a Class of Kernel Functions

Bulletin of the Australian Mathematical Society
Mathematics
2005English

Complete Solution for Linear Programming Problem in Two Variables and One Restriction

Acta Marisiensis. Seria Technologica
2019English

Convergence of Interior Point Algorithms for the Monotone Linear Complementarity Problem

Mathematics of Operations Research
Management ScienceComputer Science ApplicationsOperations ResearchMathematics
1996English

On a General Class of Interior-Point Algorithms for Semidefinite Programming With Polynomial Complexity and Superlinear Convergence

Methods and Applications of Analysis
1999English

Dual Barrier Functions With Superfast Rates of Convergence for the Linear Programming Problem

The Journal of the Australian Mathematical Society. Series B. Applied Mathematics
1987English

Low-Complexity Interior Point Algorithms for Stochastic Programming: Derivation Analysis and Performance Evaluation

2000English

A Superlinearly Convergent Polynomial Primal-Dual Interior-Point Algorithm for Linear Programming

SIAM Journal on Optimization
Theoretical Computer ScienceSoftware
1993English

Two Linear Programming Algorithms for the Linear Discrete $L\sb {1}$ Norm Problem

Mathematics of Computation
Computational MathematicsApplied MathematicsNumber TheoryAlgebra
1979English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2024 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy