scientific article; zbMATH DE number 4197739

zbMATH Open0725.90058MaRDI QIDQ5202838FDOQ5202838

Authors: Narendra K. Karmarkar 

Publication date: 1990

Title of this publication is not available (Why is that?)

Recommendations

• The Nonlinear Geometry of Linear Programming. III Projective Legendre Transform Coordinates and Hilbert Geometry
• The Nonlinear Geometry of Linear Programming. I Affine and Projective Scaling Trajectories
• On the Riemannian geometry defined by self-concordant barriers and interior-point methods.
• Information geometry and interior-point algorithms in semidefinite programs and symmetric cone programs
• Information Geometry and Interior-Point Algorithms

zbMATH Keywords

scalar curvatureinterior-point algorithmcontinuous trajectoriesprojective and affine algorithmsprojectively invariant Riemannian metric

Mathematics Subject Classification ID

Linear programming (90C05) Methods of local Riemannian geometry (53B21) Computational methods for problems pertaining to operations research and mathematical programming (90-08)

Cited In (32)

• On the convergence time of a natural dynamics for linear programming
• On the convergence time of a natural dynamics for linear programming
• A continuous approach to inductive inference
• Randomized interior point methods for sampling and optimization
• Nonlinear coordinate representations of smooth optimization problems
• Scaling, shifting and weighting in interior-point methods
• An application of the continuous time replicator dynamic to economics
• Integrability of vector and multivector fields associated with interior point methods for linear programming
• The Nonlinear Geometry of Linear Programming. III Projective Legendre Transform Coordinates and Hilbert Geometry
• A class of primal affine scaling algorithms
• On the convergence of gradient-like flows with noisy gradient input
• Geodesic Walks in Polytopes
• The curvature integral and the complexity of linear complementarity problems
• Subgradient algorithm on Riemannian manifolds
• On the Riemannian geometry defined by self-concordant barriers and interior-point methods.
• A strong bound on the integral of the central path curvature and its relationship with the iteration-complexity of primal-dual path-following LP algorithms
• On explicit solvable gradient systems of Moser-Karmarkar type
• Gradient systems associated with probability distributions
• A class of polynomial variable metric algorithms for linear optimization
• On the complexity of following the central path of linear programs by linear extrapolation. II
• Estimating the complexity of a class of path-following methods for solving linear programs by curvature integrals
• An optimization framework of biological dynamical systems
• Lax pair and fixed point analysis of Karmarkar's projective scaling trajectory for linear programming
• Kantorovich's theorem on Newton's method under majorant condition in Riemannian manifolds
• Title not available (Why is that?)
• Information geometry and interior-point algorithms in semidefinite programs and symmetric cone programs
• Curvature integrals and iteration complexities in SDP and symmetric cone programs
• New self-concordant barrier for the hypercube
• Jacobi algorithm for symmetric eigenvalue problem and integrable gradient system of Lax form
• First order methods for optimization on Riemannian manifolds
• The Nonlinear Geometry of Linear Programming. II Legendre Transform Coordinates and Central Trajectories
• A Geodesic Interior-Point Method for Linear Optimization over Symmetric Cones

This page was built for publication:

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