Results 1 to 10 of about 291 (36)
Demonstratio Mathematica, 2023 In this article, weak and strong convergence theorems of the M-iteration method for š¯’¢-nonexpansive mapping in a uniformly convex Banach space with a directed graph were established.
Chairatsiripong Chonjaroen +2 more
doaj +1 more source
A Dai-Liao-type projection method for monotone nonlinear equations and signal processing
Demonstratio Mathematica, 2022 In this article, inspired by the projection technique of Solodov and Svaiter, we exploit the simple structure, low memory requirement, and good convergence properties of the mixed conjugate gradient method of Stanimirović et al.
Ibrahim Abdulkarim Hassan +4 more
doaj +1 more source
Dynamics of Dengue epidemics using optimal control [PDF]
, 2010 We present an application of optimal control theory to Dengue epidemics. This epidemiologic disease is an important theme in tropical countries due to the growing number of infected individuals.
Betts +14 more
core +2 more sources
Nonconvex notions of regularity and convergence of fundamental algorithms for feasibility problems [PDF]
, 2013 We consider projection algorithms for solving (nonconvex) feasibility problems in Euclidean spaces. Of special interest are the Method of Alternating Projections (MAP) and the Douglas-Rachford or Averaged Alternating Reflection Algorithm (AAR).
Hesse, Robert, Luke, D. Russell
core +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 globally convergent algorithm for MPCC
EURO Journal on Computational Optimization, 2015 We propose a penalty formulation based on the new regularization scheme for mathematical programs with complementarity constraints (MPCCs). We present an active set method which solves a sequence of penalty-regularized problems.
Abdeslam Kadrani +2 more
doaj +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
Linear Convergence of the Douglas-Rachford Method for Two Closed Sets [PDF]
, 2015 In this paper, we investigate the Douglas-Rachford method for two closed (possibly nonconvex) sets in Euclidean spaces. We show that under certain regularity conditions, the Douglas-Rachford method converges locally with R-linear rate. In convex settings,
Phan, Hung M.
core +1 more source
Equilibrium of a production economy with non-compact attainable allocations set
Advances in Nonlinear Analysis, 2018 In this paper, we consider a production economy with an unbounded attainable set where the consumers may have non-complete non-transitive preferences.
Ounaies Senda +2 more
doaj +1 more source
Learning to steer nonlinear interior-point methods
EURO Journal on Computational Optimization, 2019 Interior-point or barrier methods handle nonlinear programs by sequentially solving barrier subprograms with a decreasing sequence of barrier parameters.
Renke Kuhlmann
doaj +1 more source