Solution of a non-linear programming problem with quadratic functions

DOI10.1080/02331939408843934zbMATH Open0819.90100OpenAlexW2089801830MaRDI QIDQ4764883FDOQ4764883

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

Recommendations

• scientific article; zbMATH DE number 1839735
• Branch-and-bound method for the minimization problem for a nonconvex quadratic function under convex quadratic constraints
• Inscribed ball and enclosing box methods for the convex maximization problem
• A dual algorithm for the minimum covering weighted ball problem in \({\mathbb{R}^n}\)
• Numerical solution of special problems of nonconvex quadratic programming

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

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

Cited In (2)

• Title not available (Why is that?)
• Algebraic solution of the problems of nonconvex quadratic programming

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

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