Pages that link to "Item:Q1899195"
From MaRDI portal
The following pages link to Introduction to global optimization (Q1899195):
Displayed 50 items.
- 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)
- An outcome space approach for generalized convex multiplicative programs (Q969745) (← links)
- A new global optimization approach for convex multiplicative programming (Q972168) (← links)
- A filled function method with one parameter for box constrained global optimization (Q990643) (← links)
- Detecting critical nodes in sparse graphs (Q1013394) (← links)
- Knapsack feasibility as an absolute value equation solvable by successive linear programming (Q1024724) (← links)
- On Tikhonov's reciprocity principle and optimality conditions in d. c. optimization (Q1270696) (← links)
- Utility function programs and optimization over the efficient set in multiple-objective decision making (Q1356096) (← links)
- Lagrange duality and partitioning techniques in nonconvex global optimization (Q1372558) (← links)
- Necessary and sufficient global optimality conditions for convex maximization revisited (Q1378644) (← links)
- On the complexity of approximating a KKT point of quadratic programming (Q1380927) (← links)
- Applications of interval arithmetic in non-smooth global optimization (Q1405071) (← links)
- Subdivision, sampling, and initialization strategies for simplical branch and bound in global optimization. (Q1416301) (← links)
- Global optimization based on a statistical model and simplicial partitioning. (Q1416303) (← links)
- Least squares splines with free knots: Global optimization approach. (Q1426188) (← links)
- Computability on continuous, lower semi-continuous and upper semi-continuous real functions (Q1575670) (← links)
- Recent developments and trends in global optimization (Q1593827) (← links)
- Evidence and credibility: Full Bayesian signifiance test for precise hypotheses (Q1612919) (← links)
- Improved approximation results on standard quartic polynomial optimization (Q1686564) (← links)
- An efficient strategy for the activation of MIP relaxations in a multicore global MINLP solver (Q1704912) (← links)
- D.C. programming approach for solving an applied ore-processing problem (Q1716969) (← links)
- Global optimization based on bisection of rectangles, function values at diagonals, and a set of Lipschitz constants (Q1754443) (← links)
- An algorithm of simplicial Lipschitz optimization with the bi-criteria selection of simplices for the bi-section (Q1754452) (← links)
- On convergence rate of a rectangular partition based global optimization algorithm (Q1754460) (← links)