Results 21 to 30 of about 105 (103)
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
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
An Inertial Three‐Term Conjugate Gradient Projection Method With Applications
This paper introduces a robust inertial three‐term projection method for solving monotone nonlinear equations. The proposed approach extends existing nonlinear conjugate gradient (CG) methods for unconstrained optimization with inexact line search by incorporating an inertial mechanism and a redesigned three‐term search direction to enhance numerical ...
Muhammad Abdullahi +7 more
wiley +1 more source
A comparison of four approaches from stochastic programming for large-scale unit-commitment
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
Abstract Improving parental sensitivity is an important objective of interventions to support families. This study examined reliability and validity of parental sensitivity ratings using a novel package of an e‐learning tool and an interactive decision tree provided through a mobile application, called the OK! package.
Mirte L. Forrer +3 more
wiley +1 more source
A center of a polytope: An expository review and a parallel implementation
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
A parametric linearizing approach for quadratically inequality constrained quadratic programs
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
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
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
On the construction of quadratic models for derivative-free trust-region algorithms
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

