New LP bound in multivariate Lipschitz optimization: Theory and applications

Related Items

Utility function programs and optimization over the efficient set in multiple-objective decision making, Linearly constrained global minimization of functions with concave minorants, Solving sum-of-ratios fractional programs using efficient points, Globally tight bounds for almost differentiable functions over polytopes with application to tolerance analysis., A validation and verification tool for global optimization solvers

Cites Work

Unnamed Item
Unnamed Item
Multidimensional bisection: the performance and the context
Extended univariate algorithms for \(n\)-dimensional global optimization
The cubic algorithm
On the convergence of global methods in multiextremal optimization
Global optimization on convex sets
An algorithm for global optimization of Lipschitz continuous functions
Deterministic global optimization with partition sets whose feasibility is not known: Application to concave minimization, reserve convex constraints, DC-programming and Lipschitzian optimization
Precision, complexity, and computational schemes of the cubic algorithms
Branch-and-bound methods for solving systems of Lipschitzian equations and inequalities
Convergence and restart in branch-and-bound algorithms for global optimization. Application to concave minimization and d.c. optimization problems
Modification, implementation and comparison of three algorithms for globally solving linearly constrained concave minimization problems
Multidimensional bisection applied to global optimisation
Convergence rates of a global optimization algorithm
The bisection method in higher dimensions
An application of Lipschitzian global optimization to product design
Algorithms for multi-extremal mathematical programming problems employing the set of joint space-filling curves
Outer approximation algorithm for nondifferentiable optimization problems
Globally convergent methods for n-dimensional multiextremal optimization
An algorithm for finding the global maximum of a multimodal, multivariate function
Branch- and bound algorithms for solving global optimization problems with Lipschitzian structure
An algorithm for nonconvex programming problems
An algorithm for finding the absolute extremum of a function