scientific article; zbMATH DE number 7564730

zbMath1496.90111MaRDI QIDQ5091983

Norbert Tóth, Mihály Bessenyei

Publication date: 27 July 2022

Full work available at URL: https://www.heldermann.de/JCA/JCA29/JCA293/jca29048.htm#jca293

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

Lagrange multiplierscomplementary slacknesslog-barrier problemrecessional cone

Mathematics Subject Classification ID

Convex programming (90C25) Linear programming (90C05) Interior-point methods (90C51) Convex functions and convex programs in convex geometry (52A41)

Cites Work

• A new polynomial-time algorithm for linear programming
• Convex analysis and nonlinear optimization. Theory and examples.
• The Nonlinear Geometry of Linear Programming. I Affine and Projective Scaling Trajectories
• The Nonlinear Geometry of Linear Programming. II Legendre Transform Coordinates and Central Trajectories
• Convex Analysis
• Interior Point Methods for Linear Optimization
• Linear programming. Foundations and extensions
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: