Pages that link to "Item:Q1899195"
From MaRDI portal
The following pages link to Introduction to global optimization (Q1899195):
Displayed 50 items.
- 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 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)
- 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)
- 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)
- 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)
- 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)