scientific article; zbMATH DE number 4018776
From MaRDI portal
zbMATH Open0626.90064MaRDI QIDQ3030587FDOQ3030587
Authors: Rachid Benacer, Pham Dinh Tao
Publication date: 1986
Title of this publication is not available (Why is that?)
Recommendations
- A finite algorithm for solving general quadratic problems
- Numerical solution of special problems of nonconvex quadratic programming
- Global optimization algorithms for linearly constrained indefinite quadratic problems
- scientific article; zbMATH DE number 3939107
- On the maximization and minimization of a quasiconvex function
convex polyhedronKuhn-Tucker conditionadditional reverse convex constraintpivoting algorithmnondefinite quadratic function
Cited In (9)
- Title not available (Why is that?)
- Globally maximizing the sum of squares of quadratic forms over the unit sphere
- Non-convex quadratic optimization on a parallelepiped
- On a particular quadratic network problem
- Optimality conditions for maximizing a function over a polyhedron
- Reduction of indefinite quadratic programs to bilinear programs
- Global optimization conditions for certain nonconvex minimization problems
- A reformulation-convexification approach for solving nonconvex quadratic programming problems
- Title not available (Why is that?)
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3030587)