Solution of a non-linear programming problem with quadratic functions

DOI10.1080/02331939408843934zbMath0819.90100OpenAlexW2089801830MaRDI QIDQ4764883

É. I. Nenakhov, M. E. Primak

Publication date: 20 April 1995

Published in: Optimization (Search for Journal in Brave)

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

zbMATH Keywords

inversion transformationbranch-and- boundlocal extremumglobal extremumintersection of a finite collection of ballsvector of maximum length

Mathematics Subject Classification ID

Convex programming (90C25) Nonlinear programming (90C30)

Cites Work

• Unnamed Item
• Concave minimization via conical partitions and polyhedral outer approximation
• A Conical Algorithm for Globally Minimizing a Concave Function Over a Closed Convex Set
• Methods for Global Concave Minimization: A Bibliographic Survey
• Parametric approach to a class of nonconvex global optimization problems
• The complexity of a special convex programming problem connected with nonlinear optimization
• A Maxmin Location Problem

This page was built for publication: Solution of a non-linear programming problem with quadratic functions