The complexity of a special convex programming problem connected with nonlinear optimization

DOI10.1080/02331939308843883zbMath0818.90071OpenAlexW1968194284MaRDI QIDQ3835664

É. I. Nenakhov, M. E. Primak

Publication date: 17 August 1995

Published in: Optimization (Search for Journal in Brave)

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

zbMATH Keywords

computational costinfinite feasible sets

Mathematics Subject Classification ID

Convex programming (90C25) Abstract computational complexity for mathematical programming problems (90C60) Linear programming (90C05)

Related Items

Solution of a non-linear programming problem with quadratic functions

Cites Work

• Unnamed Item
• An algorithm for linear programming which requires \(O(((m+n)n^ 2+(m+n)^{1.5}n)L)\) arithmetic operations
• A Maxmin Location Problem
• Location of the Maximum on Unimodal Surfaces