The theory of abstract convexity provides us with the necessary tools for building accurate one-sided approximations of functions. Cutting angle methods have recently emerged as a tool for global optimization of families of abstract convex functions. Their applicability have been subsequently extended to other problems, such as scattered data interpolation. This paper reviews three different applications of cutting angle methods, namely global optimization, generation of nonuniform random variates and multivatiate interpolation. <br /
The paper deals with a method for global minimization of increasing positively homogeneous functions...
Convex optimization has an increasing impact on many areas of mathematics, applied sciences, and pra...
Global optimization of continuous, non-linear functions are very hard problems, especially when the ...
"The main objective of this thesis is to develop and study new techniques for solving global optimiz...
Cutting angle method (CAM) is a deterministic global optimization technique applicable to Lipschitz ...
Lower approximation of Lipschitz functions plays an important role in deterministic global optimizat...
The paper deals with combinations of the cutting angle method in global optimization and a local sea...
Methods of Lipschitz optimization allow one to find and confirm the global minimum of multivariate L...
We discuss the applicability of the cutting angle method to global minimization of marginal function...
In this paper, we propose a new algorithm for global minimization of functions represented as a diff...
Many problems in chemistry depend on the ability to identify the global minimum or maximum of a func...
We present a survey of nondifferentiable optimization problems and methods with special focus on the...
The equivalent formulation of a convex optimization problem is the computation of a value of a conju...
Global optimization of continuous, non-linear functions are very hard problems, especially when the ...
In this article we develop a global optimization algorithm for quasiconvex programming where the obj...
The paper deals with a method for global minimization of increasing positively homogeneous functions...
Convex optimization has an increasing impact on many areas of mathematics, applied sciences, and pra...
Global optimization of continuous, non-linear functions are very hard problems, especially when the ...
"The main objective of this thesis is to develop and study new techniques for solving global optimiz...
Cutting angle method (CAM) is a deterministic global optimization technique applicable to Lipschitz ...
Lower approximation of Lipschitz functions plays an important role in deterministic global optimizat...
The paper deals with combinations of the cutting angle method in global optimization and a local sea...
Methods of Lipschitz optimization allow one to find and confirm the global minimum of multivariate L...
We discuss the applicability of the cutting angle method to global minimization of marginal function...
In this paper, we propose a new algorithm for global minimization of functions represented as a diff...
Many problems in chemistry depend on the ability to identify the global minimum or maximum of a func...
We present a survey of nondifferentiable optimization problems and methods with special focus on the...
The equivalent formulation of a convex optimization problem is the computation of a value of a conju...
Global optimization of continuous, non-linear functions are very hard problems, especially when the ...
In this article we develop a global optimization algorithm for quasiconvex programming where the obj...
The paper deals with a method for global minimization of increasing positively homogeneous functions...
Convex optimization has an increasing impact on many areas of mathematics, applied sciences, and pra...
Global optimization of continuous, non-linear functions are very hard problems, especially when the ...