Global optimization advances in mixed-integer nonlinear programming, MINLP, and constrained derivative-free optimization, CDFO
This manuscript reviews recent advances in deterministic global optimization for Mixed-
Integer Nonlinear Programming (MINLP), as well as Constrained Derivative-Free …
Integer Nonlinear Programming (MINLP), as well as Constrained Derivative-Free …
Recent advances in DC programming and DCA
T Pham Dinh, HA Le Thi - Transactions on computational intelligence XIII, 2014 - Springer
Difference of Convex functions (DC) Programming and DC Algorithm (DCA) constitute the
backbone of Nonconvex Programming and Global Optimization. The paper is devoted to the …
backbone of Nonconvex Programming and Global Optimization. The paper is devoted to the …
DC programming and DCA: thirty years of developments
HA Le Thi, T Pham Dinh - Mathematical Programming, 2018 - Springer
The year 2015 marks the 30th birthday of DC (Difference of Convex functions) programming
and DCA (DC Algorithms) which constitute the backbone of nonconvex programming and …
and DCA (DC Algorithms) which constitute the backbone of nonconvex programming and …
The DC (difference of convex functions) programming and DCA revisited with DC models of real world nonconvex optimization problems
The DC programming and its DC algorithm (DCA) address the problem of minimizing a
function f= g− h (with g, h being lower semicontinuous proper convex functions on R n) on …
function f= g− h (with g, h being lower semicontinuous proper convex functions on R n) on …
[图书][B] Newton-type methods for optimization and variational problems
AF Izmailov, MV Solodov - 2014 - Springer
This book is entirely devoted to mathematical analysis of Newton-type methods for
variational and optimization problems in finite-dimensional spaces. Newtonian methods are …
variational and optimization problems in finite-dimensional spaces. Newtonian methods are …
Group decision making with heterogeneous preference structures: An automatic mechanism to support consensus reaching
In real-world decision problems, decision makers usually express their opinions with
different preference structures. In order to deal with the heterogeneous preference …
different preference structures. In order to deal with the heterogeneous preference …
DC approximation approaches for sparse optimization
Sparse optimization refers to an optimization problem involving the zero-norm in objective or
constraints. In this paper, nonconvex approximation approaches for sparse optimization …
constraints. In this paper, nonconvex approximation approaches for sparse optimization …
[图书][B] Global optimization: theory, algorithms, and applications
M Locatelli, F Schoen - 2013 - SIAM
The first systematic overviews on global optimization appeared in 1975–1978 thanks to two
fundamental volumes titled Towards Global Optimization (Dixon & Szegö, 1975, 1978). At …
fundamental volumes titled Towards Global Optimization (Dixon & Szegö, 1975, 1978). At …
Exact penalty and error bounds in DC programming
In the present paper, we are concerned with conditions ensuring the exact penalty for
nonconvex programming. Firstly, we consider problems with concave objective and …
nonconvex programming. Firstly, we consider problems with concave objective and …
DC programming and DCA for general DC programs
We present a natural extension of DC programming and DCA for modeling and solving
general DC programs with DC constraints. Two resulting approaches consist in …
general DC programs with DC constraints. Two resulting approaches consist in …