scientific article; zbMATH DE number 4005983

zbMATH Open0619.90055MaRDI QIDQ3757693FDOQ3757693

Authors:

Publication date: 1986

Title of this publication is not available (Why is that?)

Recommendations

• scientific article; zbMATH DE number 2205685
• scientific article; zbMATH DE number 3148888
• scientific article; zbMATH DE number 3980939
• On the Maximization of a Concave Quadratic Function with Box Constraints
• The search for a global maximum of a convex functional on an admissible set

zbMATH Keywords

cutting planelinear constraintsconvex quadratic function

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Quadratic programming (90C20) Convex programming (90C25) Methods of successive quadratic programming type (90C55)

Cited In (14)

• A cutting method for finding discrete minimax with dropping of cutting planes
• Title not available (Why is that?)
• Cutting-Planes for Optimization of Convex Functions over Nonconvex Sets
• On the relation between concavity cuts and the surrogate dual for convex maximization problems
• Title not available (Why is that?)
• Quadratic maximization of reachable values of affine systems with diagonalizable matrix
• Piece adding technique for convex maximization problems
• Quadratic cone cutting surfaces for quadratic programs with on-off constraints
• Solving Quadratic Programming by Cutting Planes
• Title not available (Why is that?)
• Modified cutting plane method for minimization of a convex function
• Towards a Practical Volumetric Cutting Plane Method for Convex Programming
• A cutting plane method for solving minimax problems in the complex plane
• 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 Q3757693)