Pages that link to "Item:Q1304172"
From MaRDI portal
The following pages link to Handbook of test problems in local and global optimization (Q1304172):
Displaying 50 items.
- A review of recent advances in global optimization (Q842710) (← links)
- On generalized geometric programming problems with non-positive variables (Q857357) (← links)
- Border basis relaxation for polynomial optimization (Q898268) (← links)
- Probability bounds analysis for nonlinear population ecology models (Q899221) (← links)
- Local optimization of dynamic programs with guaranteed satisfaction of path constraints (Q901119) (← links)
- A parametric linear relaxation algorithm for globally solving nonconvex quadratic programming (Q902804) (← links)
- A filled function method for constrained global optimization (Q925228) (← links)
- New bounds on the unconstrained quadratic integer programming problem (Q925231) (← links)
- General variable neighborhood search for the continuous optimization (Q932193) (← links)
- Analysis of EEG data using optimization, statistics, and dynamical system techniques (Q956771) (← links)
- Filled function method for nonlinear equations (Q966079) (← links)
- Piecewise-linear approximations of multidimensional functions (Q970578) (← links)
- The oracle penalty method (Q975775) (← links)
- An algorithm for constrained global optimization of multivariate polynomials using the Bernstein form and John optimality conditions (Q980524) (← links)
- Enhancing PSO methods for global optimization (Q984327) (← links)
- On locating all roots of systems of nonlinear equations inside bounded domain using global optimization methods (Q984531) (← links)
- The global convergence of augmented Lagrangian methods based on NCP function in constrained nonconvex optimization (Q1004224) (← links)
- The stochastic trim-loss problem (Q1011257) (← links)
- Trust-region quadratic methods for nonlinear systems of mixed equalities and inequalities (Q1012237) (← links)
- Extended ant colony optimization for non-convex mixed integer nonlinear programming (Q1013399) (← links)
- Recognizing underlying sparsity in optimization (Q1013977) (← links)
- A new filled function method for nonlinear equations (Q1021533) (← links)
- Solving systems of nonlinear equations with continuous GRASP (Q1026675) (← links)
- Global optimization of robust chance constrained problems (Q1029686) (← links)
- Nonmonotonic reduced projected Hessian method via an affine scaling interior modified gradient path for bounded-constrained optimization (Q1031969) (← links)
- A projected gradient method with nonmonotonic backtracking technique for solving convex constrained monotone variational inequality problem (Q1032811) (← links)
- Statistical inferences for termination of Markov type random search algorithms (Q1035887) (← links)
- A collection of test problems for constrained global optimization algorithms (Q1188890) (← links)
- Active set strategies in an ellipsoid algorithm for nonlinear programming (Q1433159) (← links)
- Best practices for comparing optimization algorithms (Q1642983) (← links)
- An inexact Newton-like conditional gradient method for constrained nonlinear systems (Q1651415) (← links)
- How difficult is nonlinear optimization? A practical solver tuning approach, with illustrative results (Q1657404) (← links)
- On metaheuristics for solving the parameter estimation problem in dynamic systems: a comparative study (Q1659343) (← links)
- A modified hybrid genetic algorithm for solving nonlinear optimal control problems (Q1664734) (← links)
- An edge-concave underestimator for the global optimization of twice-differentiable nonconvex problems (Q1668794) (← links)
- A new class of nonmonotone adaptive trust-region methods for nonlinear equations with box constraints (Q1675425) (← links)
- Individual confidence intervals for solutions to expected value formulations of stochastic variational inequalities (Q1680965) (← links)
- The cluster problem in constrained global optimization (Q1683326) (← links)
- A trajectory-based method for mixed integer nonlinear programming problems (Q1704918) (← links)
- A derivative-free trust region algorithm with nonmonotone filter technique for bound constrained optimization (Q1721017) (← links)
- A novel optimization method for nonconvex quadratically constrained quadratic programs (Q1724769) (← links)
- DC programming and DCA: thirty years of developments (Q1749443) (← links)
- A filled function method dominated by filter for nonlinearly global optimization (Q1756190) (← links)
- Levenberg-Marquardt methods with strong local convergence properties for solving nonlinear equations with convex constraints (Q1765264) (← links)
- Some global optimization problems on Stiefel manifolds (Q1768631) (← links)
- Test problem generator for the multidimensional assignment problem (Q1774571) (← links)
- Fuzzy costs in quadratic programming problems (Q1794338) (← links)
- Global convergence enhancement of classical linesearch interior point methods for MCPs (Q1861321) (← links)
- An affine scaling trust-region approach to bound-constrained nonlinear systems (Q1861959) (← links)
- On the global convergence of a Levenberg-Marquardt method for constrained nonlinear equations (Q1885077) (← links)
