Pages that link to "Item:Q1304172"
From MaRDI portal
The following pages link to Handbook of test problems in local and global optimization (Q1304172):
Displayed 50 items.
- Normalized multiparametric disaggregation: an efficient relaxation for mixed-integer bilinear problems (Q280099) (← links)
- A class of parameter-free filled functions for box-constrained system of nonlinear equations (Q287871) (← links)
- Extended reverse-convex programming: an approximate enumeration approach to global optimization (Q288222) (← links)
- Global optimization of signomial geometric programming problems (Q296971) (← links)
- Global optimization with spline constraints: a new branch-and-bound method based on B-splines (Q300751) (← links)
- A multi-layer line search method to improve the initialization of optimization algorithms (Q320070) (← links)
- Global optimization advances in mixed-integer nonlinear programming, MINLP, and constrained derivative-free optimization, CDFO (Q322958) (← links)
- Multiobjective cuckoo search for design optimization (Q336332) (← links)
- Topographical global initialization for finding all solutions of nonlinear systems with constraints (Q343685) (← links)
- GLOMIQO: global mixed-integer quadratic optimizer (Q367170) (← links)
- A framework for globally optimizing mixed-integer signomial programs (Q398656) (← links)
- On solving linear complementarity problems by DC programming and DCA (Q409266) (← links)
- Range reduction techniques for improving computational efficiency in global optimization of signomial geometric programming problems (Q421696) (← links)
- Global optimality conditions and optimization methods for quadratic assignment problems (Q422852) (← links)
- TRESNEI, a MATLAB trust-region solver for systems of nonlinear equalities and inequalities (Q434175) (← links)
- The role of different genetic operators in the optimization of magnetic models (Q440860) (← links)
- On linear programs with linear complementarity constraints (Q452341) (← links)
- Enhancing RLT-based relaxations for polynomial programming problems via a new class of \(v\)-semidefinite cuts (Q453612) (← links)
- Finding multiple roots of a box-constrained system of nonlinear equations with a biased random-key genetic algorithm (Q486399) (← links)
- An affine scaling derivative-free trust region method with interior backtracking technique for bounded-constrained nonlinear programming (Q488945) (← links)
- A filling function method for unconstrained global optimization (Q493693) (← links)
- Global optimality conditions and optimization methods for polynomial programming problems (Q496629) (← links)
- Conjugate gradient path method without line search technique for derivative-free unconstrained optimization (Q501963) (← links)
- Bounds tightening based on optimality conditions for nonconvex box-constrained optimization (Q506441) (← links)
- A new trust-region method for solving systems of equalities and inequalities (Q520331) (← links)
- Global optimization test problems based on random field composition (Q523165) (← links)
- MSO: a framework for bound-constrained black-box global optimization algorithms (Q524912) (← links)
- Piecewise convex maximization problems: Piece adding technique (Q535077) (← links)
- An integral function and vector sequence method for unconstrained global optimization (Q540707) (← links)
- A dynamic convexized method for nonconvex mixed integer nonlinear programming (Q547132) (← links)
- Piece adding technique for convex maximization problems (Q604949) (← links)
- A new filled function method for an unconstrained nonlinear equation (Q611845) (← links)
- Solving a class of low rank d.c. programs via a branch and bound approach: a computational experience (Q613323) (← links)
- Inexact Newton method via Lanczos decomposed technique for solving box-constrained nonlinear systems (Q616036) (← links)
- Extending and relating different approaches for solving fuzzy quadratic problems (Q635935) (← links)
- A differential evolution algorithm to deal with box, linear and quadratic-convex constraints for boundary optimization (Q656831) (← links)
- Finding the roots of system of nonlinear equations by a novel filled function method (Q657106) (← links)
- Global optimality conditions and optimization methods for quadratic knapsack problems (Q658556) (← links)
- Nonconvex generalized Benders decomposition for stochastic separable mixed-integer nonlinear programs (Q662860) (← links)
- Attractive force search algorithm for piecewise convex maximization problems (Q694170) (← links)
- Levenberg--Marquardt methods with strong local convergence properties for solving nonlinear equations with convex constraints (Q704198) (← links)
- Genanneal: genetically modified simulated annealing (Q709868) (← links)
- MinFinder: locating all the local minima of a function (Q709933) (← links)
- A filled function method for global optimization with inequality constraints (Q725788) (← links)
- A Newton conditional gradient method for constrained nonlinear systems (Q730572) (← links)
- A branch and reduce approach for solving a class of low rank d.c. programs (Q732158) (← links)
- New methods for calculating \(\alpha\)BB-type underestimators (Q742131) (← links)
- TACO: a toolkit for AMPL control optimization (Q744209) (← links)
- A successive linear approximation algorithm for the global minimization of a concave quadratic program (Q827382) (← links)
- An inexact-restoration method for nonlinear bilevel programming problems (Q839690) (← links)