A method for solving maximum-problems with a nonconcave quadratic objective function

DOI10.1007/BF00539118zbMath0139.13105MaRDI QIDQ5514163

Klaus Ritter

Publication date: 1966

Published in: Zeitschrift für Wahrscheinlichkeitstheorie und verwandte Gebiete (Search for Journal in Brave)

zbMATH Keywords

operations research

Related Items (21)

Global optimization conditions for certain nonconvex minimization problems ⋮ A reformulation-convexification approach for solving nonconvex quadratic programming problems ⋮ Exact solution to a parametric linear programming problem ⋮ Integral global minimization: Algorithms, implementations and numerical tests ⋮ Properties of the general quadratic optimization problem and the corresponding linear complementarity problem ⋮ Redundante Ungleichungen bei linearen Ungleichungssystemen ⋮ A reducibility method for the weak linear bilevel programming problems and a case study in principal-agent ⋮ Zur Identifikation redundanter Nebenbedingungen in linearen Programmen ⋮ Jointly constrained bilinear programs and related problems: An overview ⋮ A new reformulation-linearization technique for bilinear programming problems ⋮ A linear programming approach to solving bilinear programmes ⋮ Linear multiplicative programming ⋮ A cutting plane algorithm for solving bilinear programs ⋮ Maximization of A convex quadratic function under linear constraints ⋮ Quasi-concave minimization subject to linear constraints ⋮ A relaxation algorithm for the minimization of a quasiconcave function on a convex polyhedron ⋮ Minimum theorems for displacement and plastic strain rate histories in structural elastoplasticity ⋮ A parametric method for solving certain nonconcave maximization problems ⋮ A matrix structural theory of piecewise linear elastoplasticity with interacting yield planes ⋮ Enhanced intersection cutting-plane approach for linear complementarity problems ⋮ Global optimization algorithms for linearly constrained indefinite quadratic problems

Cites Work

• The Gradient Projection Method for Nonlinear Programming. Part I. Linear Constraints
• The Simplex Method for Quadratic Programming
• Stationary points of quadratic maximum-problems
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A method for solving maximum-problems with a nonconcave quadratic objective function