Locally polynomial method for solving systems of linear inequalities

DOI10.1134/S0965542520020050zbMath1450.65041OpenAlexW3016639868MaRDI QIDQ2206481

Alexey A. Tret'yakov, Yuri G. Evtushenko

Publication date: 22 October 2020

Published in: Computational Mathematics and Mathematical Physics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1134/s0965542520020050

zbMATH Keywords

convergence analysisconvex functionsystem of linear inequalitieslocally polynomial-time complexity

Mathematics Subject Classification ID

Linear inequalities of matrices (15A39) Numerical linear algebra (65F99)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• The 2-factor-method with a modified Lagrange function for degenerate constrained optimization problems
• A Newton method for linear programming
• \(p\)-factor methods for nonregular inequality-constrained optimization problems
• Exact differentiable penalty for a problem of quadratic programming with the use of a gradient-projective method
• A finite gradient-projective solver for a quadratic programming problem
• A finite-termination gradient projection method for solving systems of linear inequalities
• On the non-polynomiality of the relaxation method for systems of linear inequalities
• On the Accurate Identification of Active Constraints
• Methods for solving degenerate problems
• An Algorithm for Degenerate Nonlinear Programming with Rapid Local Convergence
• Thep-Factor-Lagrange Methods for Degenerate Nonlinear Programming

This page was built for publication: Locally polynomial method for solving systems of linear inequalities