A new technique for generating quadratic programming test problems
From MaRDI portal
Recommendations
- Generating quadratic bilevel programming test problems
- Randomly Generated Test Problems for Positive Definite Quadratic Programming
- Construction of test problems in quadratic bivalent programming
- Generation of large-scale quadratic programs for use as global optimization test problems
- Generating Linear and Linear-Quadratic Bilevel Programming Problems
Cites work
- scientific article; zbMATH DE number 3934786 (Why is no real title available?)
- scientific article; zbMATH DE number 3677572 (Why is no real title available?)
- A Mathematical Program Generator MPGENR
- A collection of test problems for constrained global optimization algorithms
- A computational analysis of LCP methods for bilinear and concave quadratic programming
- A parallel algorithm for constrained concave quadratic global minimization
- Active constraints, indefinite quadratic test problems, and complexity
- Checking local optimality in constrained quadratic programming is NP- hard
- Constrained global optimization: algorithms and applications
- Construction of large-scale global minimum concave quadratic test problems
- Construction of test problems in quadratic bivalent programming
- Generating quadratic bilevel programming 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
- Global minimum test problem construction
- Jointly constrained bilinear programs and related problems: An overview
- On Generating Test Problems for Nonlinear Programming Algorithms
- Quadratic functions with exponential number of local maxima
- Quadratic programming with one negative eigenvalue is NP-hard
- Randomly Generated Test Problems for Positive Definite Quadratic Programming
- Reporting computational experiments in mathematical programming
- Some NP-complete problems in quadratic and nonlinear programming
- Technical Note—Construction of Difficult Linearly Constrained Concave Minimization Problems
Cited in
(20)- Second order cone programming relaxation of nonconvex quadratic optimization problems
- An outcome-space-based branch-and-bound algorithm for a class of sum-of-fractions problems
- Generation of large-scale quadratic programs for use as global optimization test problems
- Global solution of bilevel programs with a nonconvex inner program
- Construction of test problems in quadratic bivalent programming
- Constructing test functions for global optimization using continuous formulations of graph problems
- On Generating Test Problems for Nonlinear Programming Algorithms
- Generation of disjointly constrained bilinear programming test problems
- Generating Linear and Linear-Quadratic Bilevel Programming Problems
- New infeasible interior-point algorithm based on monomial method
- On global optimization with indefinite quadratics
- A trust-region method for nonlinear bilevel programming: algorithm and computational exper\-ience
- Computational Study of Local Search Methods for a D.C. Optimization Problem with Inequality Constraints
- Test problem generator for unconstrained global optimization
- Random test problems and parallel methods for quadratic programs and quadratic stochastic programs∗
- Generating linear, semidefinite, and second-order cone optimization problems for numerical experiments
- Randomly Generated Test Problems for Positive Definite Quadratic Programming
- Bilevel optimization: theory, algorithms, applications and a bibliography
- A numerical approach for solving some convex maximization problems
- Construction of test problems for concave minimization under linear and nonlinear constraints
This page was built for publication: A new technique for generating quadratic programming test problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1315416)
