The theory of linear programming:skew symmetric self-dual problems and the central path*

DOI10.1080/02331939408843952zbMATH Open0820.90067OpenAlexW2059202085MaRDI QIDQ4764897FDOQ4764897

Authors: Benjamin Jansen, C. Roos, Tamás Terlaky 

Publication date: 20 April 1995

Published in: Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/02331939408843952

Recommendations

• A Survey of the Implications of the Behavior of the Central Path for the Duality Theory of Linear Programming
• scientific article; zbMATH DE number 1047674
• An easy way to teach interior-point methods.
• On two homogeneous self-dual approaches to linear programming and its extensions.
• scientific article; zbMATH DE number 434731

zbMATH Keywords

interior point methodscomplementaritystrong dualityFarkas Lemmalogarithmic barrier problemskew symmetric self-dual linear program

Mathematics Subject Classification ID

Linear programming (90C05) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• A new polynomial-time algorithm for linear programming
• Convex Analysis
• Theory of games and economic behavior.
• Title not available (Why is that?)
• Title not available (Why is that?)
• An Implementation of a Primal-Dual Interior Point Method for Linear Programming
• Title not available (Why is that?)
• Title not available (Why is that?)
• A convergent criss-cross method
• Duality Theory of Linear Programs: A Constructive Approach with Applications

Cited In (14)

• Primal-dual target-following algorithms for linear programming
• Initialization in semidefinite programming via a self-dual skew-symmetric embedding
• A Survey of the Implications of the Behavior of the Central Path for the Duality Theory of Linear Programming
• New method for determining search directions for interior-point algorithms in linear optimization
• The practical behavior of the homogeneous self-dual formulations in interior point methods
• Full Nesterov-Todd step feasible interior-point algorithm for symmetric cone horizontal linear complementarity problem based on a positive-asymptotic barrier function
• Finding a maximal element of a non-negative convex set through its characteristic cone: an application to finding a strictly complementary solution
• An easy way to teach interior-point methods.
• Interior Point Methods for Nonlinear Optimization
• Improved complexity analysis of full Nesterov-Todd step interior-point methods for semidefinite optimization
• Consistency, redundancy, and implied equalities in linear systems
• Polynomial primal-dual cone affine scaling for semidefinite programming
• Probability Distributions on Partially Ordered Sets and Network Interdiction Games
• A new long-step interior point algorithm for linear programming based on the algebraic equivalent transformation

This page was built for publication: The theory of linear programming:skew symmetric self-dual problems and the central path^*

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