A method for solving maximum-problems with a nonconcave quadratic objective function
From MaRDI portal
Cites work
- scientific article; zbMATH DE number 3115465 (Why is no real title available?)
- scientific article; zbMATH DE number 3159112 (Why is no real title available?)
- scientific article; zbMATH DE number 3177188 (Why is no real title available?)
- scientific article; zbMATH DE number 3204212 (Why is no real title available?)
- scientific article; zbMATH DE number 3225772 (Why is no real title available?)
- scientific article; zbMATH DE number 3067835 (Why is no real title available?)
- Stationary points of quadratic maximum-problems
- The Gradient Projection Method for Nonlinear Programming. Part I. Linear Constraints
- The Simplex Method for Quadratic Programming
Cited in
(21)- A new reformulation-linearization technique for bilinear programming problems
- A linear programming approach to solving bilinear programmes
- Linear multiplicative programming
- Quasi-concave minimization subject to linear constraints
- Minimum theorems for displacement and plastic strain rate histories in structural elastoplasticity
- Global optimization conditions for certain nonconvex minimization problems
- Exact solution to a parametric linear programming problem
- A reformulation-convexification approach for solving nonconvex quadratic programming problems
- Integral global minimization: Algorithms, implementations and numerical tests
- A reducibility method for the weak linear bilevel programming problems and a case study in principal-agent
- 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
- Properties of the general quadratic optimization problem and the corresponding linear complementarity problem
- Zur Identifikation redundanter Nebenbedingungen in linearen Programmen
- A cutting plane algorithm for solving bilinear programs
- Maximization of A convex quadratic function under linear constraints
- A relaxation algorithm for the minimization of a quasiconcave function on a convex polyhedron
- Redundante Ungleichungen bei linearen Ungleichungssystemen
- Global optimization algorithms for linearly constrained indefinite quadratic problems
- Jointly constrained bilinear programs and related problems: An overview
This page was built for publication: A method for solving maximum-problems with a nonconcave quadratic objective function
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5514163)
