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

DOI10.1080/02331939308843883MaRDI QIDQ3835664zbMATH OpenOpenAlexFDO

Authors É. 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

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

Cites work

• A Maxmin Location Problem
• An algorithm for linear programming which requires \(O(((m+n)n^ 2+(m+n)^{1.5}n)L)\) arithmetic operations
• scientific article; zbMATH DE number 47153 (Why is no real title available?)
• Location of the Maximum on Unimodal Surfaces

Cited in

(7)

• C-programming. An outline
• Optimization algorithms for a class of nonlinear programming problems
• The complexity of approximating a nonlinear program
• Complexity of Partially Separable Convexly Constrained Optimization with Non-Lipschitzian Singularities
• Solution of a non-linear programming problem with quadratic functions
• scientific article; zbMATH DE number 4185404 (Why is no real title available?)
• C-programming problems: A class of non-linear optimization problems

This page was built for publication: The complexity of a special convex programming problem connected with nonlinear optimization

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