A new technique for generating quadratic programming test problems

DOI10.1007/BF01582148zbMath0795.90047OpenAlexW1974938452WikidataQ58040704 ScholiaQ58040704MaRDI QIDQ1315416

Paul H. Calamai, Joaquim Joao Júdice, Luis Nunes Vicente

Publication date: 10 March 1994

Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01582148

zbMATH Keywords

global optimizationlarge-scale optimizationconstrained bilinear problemstest problem generation

Mathematics Subject Classification ID

Large-scale problems in mathematical programming (90C06) Quadratic programming (90C20)

Related Items

Test problem generator for unconstrained global optimization, New infeasible interior-point algorithm based on monomial method, On global optimization with indefinite quadratics, Constructing test functions for global optimization using continuous formulations of graph problems, A trust-region method for nonlinear bilevel programming: algorithm and computational exper\-ience, Second order cone programming relaxation of nonconvex quadratic optimization problems, A numerical approach for solving some convex maximization problems, Global solution of bilevel programs with a nonconvex inner program, Construction of test problems for concave minimization under linear and nonlinear constraints, Bilevel Optimization: Theory, Algorithms, Applications and a Bibliography, Random test problems and parallel methods for quadratic programs and quadratic stochastic programs^∗, An outcome-space-based branch-and-bound algorithm for a class of sum-of-fractions problems

Uses Software

• MPGENR

Cites Work

• Unnamed Item
• Unnamed Item
• Active constraints, indefinite quadratic test problems, and complexity
• Jointly constrained bilinear programs and related problems: An overview
• Quadratic functions with exponential number of local maxima
• Constrained global optimization: algorithms and applications
• Checking local optimality in constrained quadratic programming is NP- hard
• A parallel algorithm for constrained concave quadratic global minimization
• Quadratic programming with one negative eigenvalue is NP-hard
• A computational analysis of LCP methods for bilinear and concave quadratic programming
• A collection of test problems for constrained global optimization algorithms
• Construction of large-scale global minimum concave quadratic test problems
• Generation of large-scale quadratic programs for use as global optimization test problems
• Global Minimization of a Linearly Constrained Concave Function by Partition of Feasible Domain
• Randomly Generated Test Problems for Positive Definite Quadratic Programming
• Technical Note—Construction of Difficult Linearly Constrained Concave Minimization Problems
• On Generating Test Problems for Nonlinear Programming Algorithms
• Some NP-complete problems in quadratic and nonlinear programming
• A Mathematical Program Generator MPGENR
• Reporting computational experiments in mathematical programming
• Generating quadratic bilevel programming test problems
• Construction of test problems in quadratic bivalent programming
• Global minimum test problem construction