Pages that link to "Item:Q3750046"
From MaRDI portal
The following pages link to On Generating Test Problems for Nonlinear Programming Algorithms (Q3750046):
Displaying 14 items.
- Superlinearly convergent exact penalty methods with projected structured secant updates for constrained nonlinear least squares (Q467412) (← links)
- Testing cut generators for mixed-integer linear programming (Q734353) (← links)
- More test examples for nonlinear programming codes (Q1111932) (← links)
- A new technique for generating quadratic programming test problems (Q1315416) (← links)
- A generalization of the construction of test problems for nonconvex optimization (Q1330804) (← links)
- Test problem generator by neural network for algorithms that try solving nonlinear programming problems globally (Q1580431) (← links)
- Finding multiple solutions in nonlinear integer programming with algebraic test-sets (Q1798325) (← links)
- Operations research and optimization (ORO) (Q2841150) (← links)
- A two-step superlinearly convergent projected structured BFGS method for constrained nonlinear least squares (Q2841158) (← links)
- A robust combined trust region–line search exact penalty projected structured scheme for constrained nonlinear least squares (Q2943812) (← links)
- Randomly Generated Test Problems for Positive Definite Quadratic Programming (Q3337228) (← links)
- Algorithm 728: FORTRAN subroutines for generating quadratic bilevel programming test problems (Q4371570) (← links)
- (Q4870833) (← links)
- Using a spectral scaling structured BFGS method for constrained nonlinear least squares (Q5379456) (← links)