Pages that link to "Item:Q1899195"
From MaRDI portal
The following pages link to Introduction to global optimization (Q1899195):
Displaying 50 items.
- 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)
- Constrained global optimization: algorithms and applications (Q1099780) (← 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)
- On an iterative method for solving absolute value equations (Q1758043) (← links)
- Lagrangian decomposition of block-separable mixed-integer all-quadratic programs (Q1771303) (← links)
- The DC (Difference of convex functions) programming and DCA revisited with DC models of real world nonconvex optimization problems (Q1772961) (← links)
- A branch and bound algorithm for solving a class of D-C programming (Q1780534) (← links)
- Improved scheme for selection of potentially optimal hyper-rectangles in \texttt{DIRECT} (Q1800457) (← links)
- The linear complementarity problem as a separable bilinear program (Q1804582) (← links)
- Value-estimation function method for constrained global optimization (Q1807822) (← links)
- Subdivision of simplices relative to a cutting plane and finite concave minimization (Q1817320) (← links)
- Maximizing a concave function over the efficient or weakly-efficient set (Q1847166) (← links)
- Combination between global and local methods for solving an optimization problem over the efficient set (Q1848362) (← links)
- The controlled estimation method in the multiobjective linear fractional problem (Q1885953) (← links)
- Finding all solutions of nonlinearly constrained systems of equations (Q1904647) (← links)
- A new algorithm for solving the general quadratic programming problem (Q1908926) (← links)
- Linearly constrained global minimization of functions with concave minorants (Q1918299) (← links)
- An exact algorithm for graph partitioning (Q1942271) (← links)
- Copositivity detection by difference-of-convex decomposition and \(\omega \)-subdivision (Q1949258) (← links)
- Modified T-F function method for finding global minimizer on unconstrained optimization (Q1958866) (← links)
- Global optimization problems and domain reduction strategies (Q1960192) (← links)
- DC programming: overview. (Q1969457) (← links)
- A class of optimization problems over the efficient set of a multiple criteria nonlinear programming problem (Q1971990) (← links)
- Branching and bounding improvements for global optimization algorithms with Lipschitz continuity properties (Q2018512) (← links)
- Novel global optimization algorithm with a space-filling curve and integral function (Q2059171) (← links)
- Adaptive global algorithm for solving box-constrained non-convex quadratic minimization problems (Q2073059) (← links)
- An optimization method for chaotic turbulent flow (Q2135828) (← links)
- A revision of the rectangular algorithm for a class of DC optimization problems (Q2141721) (← links)
- A hybrid of Bayesian approach based global search with clustering aided local refinement (Q2206585) (← links)
