Results 61 to 70 of about 1,159 (105)
An inertial forward–backward algorithm for the minimization of the sum of two nonconvex functions
EURO Journal on Computational Optimization, 2016 We propose a forward–backward proximal-type algorithm with inertial/memory effects for minimizing the sum of a nonsmooth function with a smooth one in the nonconvex setting.
Radu Ioan Boţ +2 more
doaj
Journal of Inequalities and Applications, 2011 In this paper, an efficient modified nonlinear conjugate gradient method for solving unconstrained optimization problems is proposed. An attractive property of the modified method is that the generated direction in each step is always descending without ...
Liu Jinkui, Wang Shaoheng
doaj
Consensus-based optimisation with truncated noise
European Journal of Applied MathematicsConsensus-based optimisation (CBO) is a versatile multi-particle metaheuristic optimisation method suitable for performing non-convex and non-smooth global optimisations in high dimensions.
Massimo Fornasier +3 more
doaj +1 more source
Tikhonov regularization of a second order dynamical system with Hessian driven damping. [PDF]
Math Program, 2021 Boţ RI, Csetnek ER, László SC.
europepmc +1 more source
Nonsmooth spectral gradient methods for unconstrained optimization
EURO Journal on Computational Optimization, 2017 To solve nonsmooth unconstrained minimization problems, we combine the spectral choice of step length with two well-established subdifferential-type schemes: the gradient sampling method and the simplex gradient method.
Milagros Loreto +3 more
doaj
Lp-norms, Log-barriers and Cramer transform in Optimization
, 2010 We show that the Laplace approximation of a supremum by Lp-norms has interesting consequences in optimization. For instance, the logarithmic barrier functions (LBF) of a primal convex problem P and its dual appear naturally when using this simple ...
Lasserre, Jean B., Zeron, Eduardo S.
core +1 more source
Optimization problems with quasiconvex inequality constraints [PDF]
The constrained optimization problem min f(x), gj(x) 0 (j = 1, . . . , p) is considered, where f : X ! R and gj : X ! R are nonsmooth functions with domain X Rn.
Ginchev Ivan, Ivanov Vsevolod
core
A hybrid approach to the solution of a pricing model with continuous demand segmentation
EURO Journal on Computational Optimization, 2013 Price optimization fits naturally the framework of bilevel programming, where a leader integrates within its decision process the reaction of rational customers.
Patrice Marcotte +2 more
doaj
On global optimization with indefinite quadratics
EURO Journal on Computational Optimization, 2017 We present an algorithmic framework for global optimization problems in which the non-convexity is manifested as an indefinite-quadratic as part of the objective function.
Marcia Fampa, Jon Lee, Wendel Melo
doaj
A second-order dynamical approach with variable damping to nonconvex smooth minimization. [PDF]
Appl Anal, 2020 Boţ RI, Csetnek ER, László SC.
europepmc +1 more source