Pages that link to "Item:Q1315416"
From MaRDI portal
The following pages link to A new technique for generating quadratic programming test problems (Q1315416):
Displaying 18 items.
- Test problem generator for unconstrained global optimization (Q337165) (← links)
- Global solution of bilevel programs with a nonconvex inner program (Q1016068) (← links)
- Construction of test problems for concave minimization under linear and nonlinear constraints (Q1265043) (← links)
- On global optimization with indefinite quadratics (Q1707078) (← links)
- Generation of disjointly constrained bilinear programming test problems (Q1803651) (← links)
- New infeasible interior-point algorithm based on monomial method (Q1919774) (← links)
- An outcome-space-based branch-and-bound algorithm for a class of sum-of-fractions problems (Q2116605) (← links)
- A trust-region method for nonlinear bilevel programming: algorithm and computational exper\-ience (Q2488050) (← links)
- A numerical approach for solving some convex maximization problems (Q2505559) (← links)
- Second order cone programming relaxation of nonconvex quadratic optimization problems (Q2770189) (← links)
- Randomly Generated Test Problems for Positive Definite Quadratic Programming (Q3337228) (← links)
- On Generating Test Problems for Nonlinear Programming Algorithms (Q3750046) (← links)
- Construction of test problems in quadratic bivalent programming (Q4371734) (← links)
- Random test problems and parallel methods for quadratic programs and quadratic stochastic programs<sup>∗</sup> (Q4514287) (← links)
- Bilevel Optimization: Theory, Algorithms, Applications and a Bibliography (Q5014642) (← links)
- Constructing test functions for global optimization using continuous formulations of graph problems (Q5717533) (← links)
- Computational Study of Local Search Methods for a D.C. Optimization Problem with Inequality Constraints (Q6488347) (← links)
- Generating linear, semidefinite, and second-order cone optimization problems for numerical experiments (Q6641002) (← links)
