Maximization of A convex quadratic function under linear constraints
From MaRDI portal
Publication:4127644
DOI10.1007/BF01580380zbMath0355.90052MaRDI QIDQ4127644
Publication date: 1976
Published in: Mathematical Programming (Search for Journal in Brave)
Related Items
On the solution and complexity of a generalized linear complementarity problem, A weighting method for 0-1 indefinite quadratic bilevel programming, 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, Introduction to QUBO, The Bipartite QUBO, The bipartite quadratic assignment problem and extensions, A decomposition approach for global optimum search in QP, NLP and MINLP problems, A finite procedure to generate feasible points for the extreme point mathematical programming problem, Global minimization of large-scale constrained concave quadratic problems by separable programming, The bilinear assignment problem: complexity and polynomially solvable special cases, Novel approaches to the discrimination problem, Jointly constrained bilinear programs and related problems: An overview, Optimal design of FIR linear phase digital filters via convex quadratic programming method, Average value of solutions of the bipartite quadratic assignment problem and linkages to domination analysis, Accelerating convergence of cutting plane algorithms for disjoint bilinear programming, On the convergence of the block nonlinear Gauss-Seidel method under convex constraints, A computational analysis of LCP methods for bilinear and concave quadratic programming, A computational comparison of some branch and bound methods for indefinite quadratic programs, 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, A cutting plane algorithm for solving bilinear programs, A new algorithm for concave quadratic programming, A note on adapting methods for continuous global optimization to the discrete case, Quadratic maximization of reachable values of affine systems with diagonalizable matrix, On the nonlinear multilevel programming problems, A finitely convergent algorithm for bilinear programming problems using polar cuts and disjunctive face cuts, Generation of disjointly constrained bilinear programming test problems, Optimal input design for system identification using spectral decomposition, Convergence of a subgradient method for computing the bound norm of matrices, On the global minimization of concave functions, Decomposition methods for solving nonconvex quadratic programs via branch and bound, The bipartite unconstrained 0-1 quadratic programming problem: polynomially solvable cases
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Nonlinear Power of Adjacent Extreme Point Methods in Linear Programming
- Global Maximization of a Convex Function with Linear Inequality Constraints
- A cutting plane algorithm for solving bilinear programs
- A linear max—min problem
- Nonlinear Programming: Counterexamples to Two Global Optimization Algorithms
- A method for solving maximum-problems with a nonconcave quadratic objective function
- On Connections Between Zero-One Integer Programming and Concave Programming Under Linear Constraints
- Solving Certain Nonconvex Quadratic Minimization Problems by Ranking the Extreme Points
