Results 41 to 50 of about 1,344 (121)
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
THREE-STEP ITERATIVE METHOD WITH EIGHTEENTH ORDER CONVERGENCE FOR SOLVING NONLINEAR EQUATIONS
, 2014 In this paper, we propose and discuss a new higher-order iterative method for solving nonlinear equations. This method based on a Halley and Householder iterative method and using predictor-corrector technique.
M. Bahgat, M. A. Hafiz
semanticscholar +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
Interiors of completely positive cones [PDF]
, 2014 A symmetric matrix $A$ is completely positive (CP) if there exists an entrywise nonnegative matrix $B$ such that $A = BB^T$. We characterize the interior of the CP cone.
Fan, Jinyan, Zhou, Anwa
core
Open Mathematics, 2018 In this paper, we present an effective algorithm for globally solving quadratic programs with quadratic constraints, which has wide application in engineering design, engineering optimization, route optimization, etc.
Tang Shuai, Chen Yuzhen, Guo Yunrui
doaj +1 more source
Improving the linear relaxation of maximum k-cut with semidefinite-based constraints
EURO Journal on Computational Optimization, 2019 We consider the maximum k-cut problem that involves partitioning the vertex set of a graph into k subsets such that the sum of the weights of the edges joining vertices in different subsets is maximized.
VilmarJefté Rodrigues de Sousa +2 more
doaj +1 more source
, 2017 Multipoint secant and interpolation methods are effective tools for solving systems of nonlinear equations. They use quasi-Newton updates for approximating the Jacobian matrix.
Burdakov, Oleg, Kamandi, Ahmad
core +1 more source
A modified Liu-Storey conjugate gradient projection algorithm for nonlinear monotone equations
, 2014 In this paper, a modified Liu-Storey (LS) conjugate gradient projection algorithm is proposed for solving nonlinear monotone equations based on a hyperplane projection technique.
Yaping Hu, Zengxin Wei
semanticscholar +1 more source
Bayero Journal of Pure and Applied Sciences, 2019 In this paper, we present Levenberg-Marquardt method for solving nonlinear systems of equations. Here, both the objective function and the symmetric Jacobian matrix are assumed to be Lipchitz continuous.
Y. B. Musa, M. Y. Waziri
semanticscholar +1 more source
On the construction of quadratic models for derivative-free trust-region algorithms
EURO Journal on Computational Optimization, 2017 We consider derivative-free trust-region algorithms based on sampling approaches for convex constrained problems and discuss two conditions on the quadratic models for ensuring their global convergence.
Adriano Verdério +3 more
doaj +1 more source