(PDF) An Interior Point Method for Linear Programming Based

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

Bulletin of the Australian Mathematical Society - United Kingdom

doi 10.1017/s0004972700038090

Full Text

Abstract

Available in full text

Categories

Date

February 1, 2005

Authors

Publisher

Cambridge University Press (CUP)

Related search

A Primal-Dual Interior-Point Method for the Semidefinite Programming Problem Based on a New Kernel Function

Journal of Nonlinear Functional Analysis

Numerical Analysis

Transfer Processes

English

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

English

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

SIAM Journal on Optimization

Theoretical Computer Science

English

A Build-Up Interior Method for Linear Programming: Affine Scaling Form

English

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

Mathematics of Operations Research

Management Science

Computer Science Applications

Operations Research

English

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

Methods and Applications of Analysis

English

An Interior Point Method for Isogeometric Contact

Computer Methods in Applied Mechanics and Engineering

Mechanics of Materials

Mechanical Engineering

Computer Science Applications

Computational Mechanics

English

On the Formulation and Theory of the Newton Interior-Point Method for Nonlinear Programming

English

An Application of the Interior Point Method to Some Mixed Integer Programming Problems

Transactions of the Institute of Systems, Control and Information Engineers

English