Pages that link to "Item:Q1899195"
From MaRDI portal
The following pages link to Introduction to global optimization (Q1899195):
Displayed 50 items.
- Fractional optimization problems (Q278521) (← links)
- A generalization of \(\omega \)-subdivision ensuring convergence of the simplicial algorithm (Q286595) (← links)
- Extended reverse-convex programming: an approximate enumeration approach to global optimization (Q288222) (← links)
- Solving the maximum vertex weight clique problem via binary quadratic programming (Q306100) (← links)
- On numerical solving the spherical separability problem (Q330492) (← links)
- Adaptive nested optimization scheme for multidimensional global search (Q330495) (← links)
- Maximizing for the sum of ratios of two convex functions over a convex set (Q336507) (← links)
- Optimal configuration of a decentralized, market-driven production/inventory system (Q383152) (← links)
- Constructing uniform designs: A heuristic integer programming method (Q413474) (← links)
- A convergent simplicial algorithm with \(\omega \)-subdivision and \(\omega \)-bisection strategies (Q427360) (← links)
- A hybrid method for quantum global optimization (Q427367) (← links)
- Exact penalty and error bounds in DC programming (Q427389) (← links)
- Sample average approximation of stochastic dominance constrained programs (Q431031) (← links)
- Global minimization of a generalized linear multiplicative programming (Q450102) (← links)
- On a global optimization algorithm for bivariate smooth functions (Q481774) (← links)
- Solving DC programs using the cutting angle method (Q486726) (← links)
- Global optimization numerical strategies for rate-independent processes (Q540696) (← links)
- An integral function and vector sequence method for unconstrained global optimization (Q540707) (← links)
- Constrained global optimization of expensive black box functions using radial basis functions (Q556005) (← links)
- A gradient-related algorithm with inexact line searches (Q596214) (← links)
- Uniform tree approximation by global optimization techniques (Q600944) (← links)
- Uniqueness of integer solution of linear equations (Q601980) (← links)
- Piece adding technique for convex maximization problems (Q604949) (← links)
- A filled function approach for nonsmooth constrained global optimization (Q613814) (← links)
- On the solution of generalized multiplicative extremum problems (Q635793) (← links)
- On a finite branch and bound algorithm for the global minimization of a concave power law over a polytope (Q650234) (← links)
- A new filled function method applied to unconstrained global optimization (Q668601) (← links)
- Attractive force search algorithm for piecewise convex maximization problems (Q694170) (← links)
- Iterative approximation of zeroes of monotone operators and system of generalized mixed equilibrium problems (Q694184) (← links)
- On the solution of NP-hard linear complementarity problems (Q699514) (← links)
- Convergence and application of a decomposition method using duality bounds for nonconvex global optimization (Q700712) (← links)
- A new linearization technique for multi-quadratic 0-1 programming problems. (Q703274) (← links)
- Continuous GRASP with a local active-set method for bound-constrained global optimization (Q708907) (← links)
- A modified simplicial algorithm for convex maximization based on an extension of \(\omega \)-subdivision (Q721144) (← links)
- Duality theory in fuzzy mathematical programming problems with fuzzy coefficients (Q814033) (← links)
- Solving planning and design problems in the process industry using mixed integer and global optimization (Q817211) (← links)
- A combinatorial algorithm for the TDMA message scheduling problem (Q839680) (← links)
- A parameter free filled function for unconstrained global optimization (Q846479) (← links)
- Outer approximation method incorporating a quadratic approximation for a DC programming problem (Q848730) (← links)
- Interval methods for verifying structural optimality of circle packing configurations in the unit square (Q861900) (← links)
- Reverse convex problems: an approach based on optimality conditions (Q868408) (← links)
- Unification of filled function and tunnelling function in global optimization (Q871668) (← links)
- A integral filter algorithm for unconstrained global optimization (Q879465) (← links)
- A new bound-and-reduce approach of nonconvex quadratic programming problems (Q902837) (← links)
- Global maximization of a generalized concave multiplicative function (Q927239) (← links)
- The semi-continuous quadratic mixture design problem: description and branch-and-bound approach (Q932200) (← links)
- A convex analysis approach for convex multiplicative programming (Q934807) (← links)
- A simplicial branch and duality bound algorithm for the sum of convex-convex ratios problem (Q953379) (← links)
- Solving knapsack problems with \(S\)-curve return functions (Q958108) (← links)
- Investigation of selection strategies in branch and bound algorithm with simplicial partitions and combination of Lipschitz bounds (Q968007) (← links)