Maximization of A convex quadratic function under linear constraints

Cites work

A cutting plane algorithm for solving bilinear programs
A linear max—min problem
A method for solving maximum-problems with a nonconcave quadratic objective function
Global Maximization of a Convex Function with Linear Inequality Constraints
scientific article; zbMATH DE number 3520156 (Why is no real title available?)
scientific article; zbMATH DE number 3215121 (Why is no real title available?)
scientific article; zbMATH DE number 3338972 (Why is no real title available?)
Nonlinear Power of Adjacent Extreme Point Methods in Linear Programming
Nonlinear Programming: Counterexamples to Two Global Optimization Algorithms
On Connections Between Zero-One Integer Programming and Concave Programming Under Linear Constraints
Solving Certain Nonconvex Quadratic Minimization Problems by Ranking the Extreme Points

Cited in

(39)

Convergence of a subgradient method for computing the bound norm of matrices
A finite procedure to generate feasible points for the extreme point mathematical programming problem
A computational analysis of LCP methods for bilinear and concave quadratic programming
Efficient algorithms for solving rank two and rank three bilinear programming problems
Reduction of indefinite quadratic programs to bilinear programs
A new reformulation-linearization technique for bilinear programming problems
Linear multiplicative programming
On the solution and complexity of a generalized linear complementarity problem
A finite concave minimization algorithm using branch and bound and neighbor generation
A composite branch and bound, cutting plane algorithm for concave minimization over a polyhedron
The bilinear assignment problem: complexity and polynomially solvable special cases
Average value of solutions of the bipartite quadratic assignment problem and linkages to domination analysis
Generation of disjointly constrained bilinear programming test problems
On the convergence of the block nonlinear Gauss-Seidel method under convex constraints
A new algorithm for concave quadratic programming
Quadratic maximization of reachable values of affine systems with diagonalizable matrix
A note on adapting methods for continuous global optimization to the discrete case
The bipartite unconstrained 0-1 quadratic programming problem: polynomially solvable cases
A weighting method for 0-1 indefinite quadratic bilevel programming
Accelerating convergence of cutting plane algorithms for disjoint bilinear programming
A decomposition approach for global optimum search in QP, NLP and MINLP problems
The bipartite quadratic assignment problem and extensions
Global minimization of large-scale constrained concave quadratic problems by separable programming
Optimal design of FIR linear phase digital filters via convex quadratic programming method
A finitely convergent algorithm for bilinear programming problems using polar cuts and disjunctive face cuts
Novel approaches to the discrimination problem
A cutting plane algorithm for solving bilinear programs
Introduction to QUBO
The bipartite QUBO
Optimal input design for system identification using spectral decomposition
Globally solving concave quadratic programs via doubly nonnegative relaxation
The independent quadratic assignment problem: complexity and polynomially solvable special cases
On the existence of Monge maps for the Gromov-Wasserstein problem
Quadratic maximization of reachable values of stable discrete-time affine systems
On the global minimization of concave functions
Decomposition methods for solving nonconvex quadratic programs via branch and bound
Jointly constrained bilinear programs and related problems: An overview
A computational comparison of some branch and bound methods for indefinite quadratic programs
On the nonlinear multilevel programming problems

This page was built for publication: Maximization of A convex quadratic function under linear constraints

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