Results 21 to 30 of about 1,196 (89)
A new smoothing method for solving nonlinear complementarity problems
Open Mathematics, 2019 In this paper, a new improved smoothing Newton algorithm for the nonlinear complementarity problem was proposed. This method has two-fold advantages. First, compared with the classical smoothing Newton method, our proposed method needn’t nonsingular of ...
Zhu Jianguang, Hao Binbin
doaj +1 more source
A New Filled Function for Global Optimization
Analele Stiintifice ale Universitatii Ovidius Constanta: Seria Matematica, 2023 The filled function method has recently become very popular in optimization theory, as it is an e cient and e ective method for finding the global minimizer of multimodal functions.
Şahiner Ahmet +2 more
doaj +1 more source
Analele Stiintifice ale Universitatii Ovidius Constanta: Seria Matematica, 2021 In this paper, in the setting of Hadamard spaces, a iterative scheme is proposed for approximating a solution of the inclusion problem for a finite family of monotone operators which is a unique solution of a variational inequality.
Ranjbar Sajad
doaj +1 more source
Subperiodic Dubiner distance, norming meshes and trigonometric polynomial optimization [PDF]
, 2018 We extend the notion of Dubiner distance from algebraic to trigonometric polynomials on subintervals of the period, and we obtain its explicit form by the Szego variant of Videnskii inequality.
Vianello, Marco
core +1 more source
On the order of the operators in the Douglas-Rachford algorithm
, 2015 The Douglas-Rachford algorithm is a popular method for finding zeros of sums of monotone operators. By its definition, the Douglas-Rachford operator is not symmetric with respect to the order of the two operators.
Bauschke, Heinz H., Moursi, Walaa M.
core +1 more source
Branch-delete-bound algorithm for globally solving quadratically constrained quadratic programs
Open Mathematics, 2017 This paper presents a branch-delete-bound algorithm for effectively solving the global minimum of quadratically constrained quadratic programs problem, which may be nonconvex.
Hou Zhisong +3 more
doaj +1 more source
A comparison of four approaches from stochastic programming for large-scale unit-commitment
EURO Journal on Computational Optimization, 2017 In energy management, the unit-commitment problem deals with computing the most cost-efficient production schedule that meets customer load, while satisfying the operational constraints of the units.
Wim van Ackooij
doaj +1 more source
A parametric linearizing approach for quadratically inequality constrained quadratic programs
Open Mathematics, 2018 In this paper we propose a new parametric linearizing approach for globally solving quadratically inequality constrained quadratic programs. By utilizing this approach, we can derive the parametric linear programs relaxation problem of the investigated ...
Jiao Hongwei, Chen Rongjiang
doaj +1 more source
EURO Journal on Computational Optimization, 2016 We analyze the proximal alternating linearized minimization algorithm (PALM) for solving non-smooth convex minimization problems where the objective function is a sum of a smooth convex function and block separable non-smooth extended real-valued convex ...
Ron Shefi, Marc Teboulle
doaj +1 more source
A center of a polytope: An expository review and a parallel implementation
, 1993 International Journal of Mathematics and Mathematical Sciences, Volume 16, Issue 2, Page 209-224, 1993.
S. K. Sen, Hongwei Du, D. W. Fausett
wiley +1 more source