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.
- Global optimization of mixed-integer quadratically-constrained quadratic programs (MIQCQP) through piecewise-linear and edge-concave relaxations (Q1925777) (← links)
- Handling equality constraints in evolutionary optimization (Q1926880) (← links)
- Derivative-free methods for bound constrained mixed-integer optimization (Q1928748) (← links)
- Constrained dogleg methods for nonlinear systems with simple bounds (Q1935576) (← links)
- A generalization of the classical \(\alpha \)BB convex underestimation via diagonal and nondiagonal quadratic terms (Q1937084) (← links)
- An exact penalty global optimization approach for mixed-integer programming problems (Q1940438) (← links)
- Multi-parametric disaggregation technique for global optimization of polynomial programming problems (Q1941031) (← links)
- A global optimization point of view to handle non-standard object packing problems (Q1941035) (← links)
- Solving constrained global optimization problems by using hybrid evolutionary computing and artificial life approaches (Q1955260) (← links)
- Convex underestimators of polynomials (Q1955542) (← links)
- A partition-based global optimization algorithm (Q1959242) (← links)
- A joint decomposition method for global optimization of multiscenario nonconvex mixed-integer nonlinear programs (Q2010085) (← links)
- A new bounded degree hierarchy with SOCP relaxations for global polynomial optimization and conic convex semi-algebraic programs (Q2010098) (← links)
- A new trust region method for solving least-square transformation of system of equalities and inequalities (Q2017830) (← links)
- Convergence analysis of modified \(p\)th power Lagrangian algorithms with alternative updating strategies for constrained nonconvex optimization (Q2029687) (← links)
- Parallel global search algorithm with local tuning for solving mixed-integer global optimization problems (Q2046391) (← links)
- Novel global optimization algorithm with a space-filling curve and integral function (Q2059171) (← links)
- A genetic algorithm with a self-reproduction operator to solve systems of nonlinear equations (Q2089889) (← links)
- Continuous cubic formulations for cluster detection problems in networks (Q2097637) (← links)
- New LP-based local and global algorithms for continuous and mixed-integer nonconvex quadratic programming (Q2124794) (← links)
- An objective penalty method for optimistic bilevel programming problems (Q2176835) (← links)
- On the global convergence of an inexact quasi-Newton conditional gradient method for constrained nonlinear systems (Q2181674) (← links)
- Inexact Newton method with feasible inexact projections for solving constrained smooth and nonsmooth equations (Q2189678) (← links)
- Mini-batch adaptive random search method for the parametric identification of dynamic systems (Q2229530) (← links)
- DEFT-FUNNEL: an open-source global optimization solver for constrained grey-box and black-box problems (Q2245001) (← links)
- ANTIGONE: algorithms for coNTinuous/Integer global optimization of nonlinear equations (Q2250093) (← links)
- An inexact modified subgradient algorithm for nonconvex optimization (Q2268922) (← links)
- Effective algorithm for solving the generalized linear multiplicative problem with generalized polynomial constraints (Q2285918) (← links)
- A local search method for optimization problem with d.c. inequality constraints (Q2295325) (← links)
- An inexact affine scaling Levenberg-Marquardt method under local error bound conditions (Q2300526) (← links)
- Modelling and optimization applied to the design of fast hydrodynamic focusing microfluidic mixer for protein folding (Q2311187) (← links)
- A novel filled function method for nonlinear equations (Q2336255) (← links)
- Univariate parameterization for global optimization of mixed-integer polynomial problems (Q2355892) (← links)
- An efficient convexification method for solving generalized geometric problems (Q2358874) (← links)
- ARGONAUT: algorithms for global optimization of constrained grey-box computational problems (Q2359400) (← links)
- Modifications of real code genetic algorithm for global optimization (Q2378969) (← links)
- Adaptive memory programming for constrained global optimization (Q2379660) (← links)
- A DIRECT-based approach exploiting local minimizations for the solution of large-scale global optimization problems (Q2379688) (← links)
- A filled function method for nonlinear equations (Q2383625) (← links)
- A robust algorithm for quadratic optimization under quadratic constraints (Q2385494) (← links)
- An interior-point affine-scaling trust-region method for semismooth equations with box constraints (Q2385544) (← links)
- Symplectic methods for the approximation of the exponential map and the Newton iteration on Riemannian submanifolds (Q2387418) (← links)
- Global convergence and the Powell singular function (Q2392109) (← links)
- Correlative sparsity structures and semidefinite relaxations for concave cost transportation problems with change of variables (Q2392116) (← links)
- Development and calibration of a currency trading strategy using global optimization (Q2392749) (← links)
- Conic approximation to quadratic optimization with linear complementarity constraints (Q2397094) (← links)
- Chaotic quantum behaved particle swarm optimization algorithm for solving nonlinear system of equations (Q2397203) (← links)
- Improved logarithmic linearizing method for optimization problems with free-sign pure discrete signomial terms (Q2397434) (← links)
- A global convergent derivative-free method for solving a system of non-linear equations (Q2408152) (← links)
- A sub-additive DC approach to the complementarity problem (Q2419555) (← links)
