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

SIAM Journal on Optimization- United States

doi 10.1137/0803006

Full Text

Abstract

Available in

Categories

Theoretical Computer Science

Date

February 1, 1993

Authors

Richard A. Tapia

Publisher

Society for Industrial & Applied Mathematics (SIAM)

Related search

Primal-Dual Interior Point QP-free Algorithm for Nonlinear Constrained Optimization

Journal of Inequalities and Applications

Applied Mathematics

Discrete Mathematics

English

A Weighted Full-Newton Step Primal-Dual Interior Point Algorithm for Convex Quadratic Optimization

Statistics, Optimization and Information Computing

Information Systems

Pattern Recognition

Computer Vision

Signal Processing

Artificial Intelligence

English

A Full Nesterov-Todd Step Feasible Weighted Primal-Dual Interior-Point Algorithm for Symmetric Optimization

Journal of the Operations Research Society of China

Management Science

Applied Mathematics

Operations Research

English

Primal-Dual Interior-Point Methods for PDE-constrained Optimization

Mathematical Programming, Series B

English

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

A Class of Large-Update and Small-Update Primal-Dual Interior-Point Algorithms for Linear Optimization

Journal of Optimization Theory and Applications

Management Science

Applied Mathematics

Operations Research

English

A Polynomial Projection-Type Algorithm for Linear Programming

Operations Research Letters

Applied Mathematics

Manufacturing Engineering

Management Science

Operations Research

English

Research on Primal-Dual Interior Point Algorithms for Mathematical Programming. Final Technical Report, August 1991--August 1993

English

Primal/Dual Linear Programming and Statistical Atlases for Cartilage Segmentation

English