Results 31 to 40 of about 1,196 (82)
Results in Applied Mathematics, 2019 In this article, we propose a three-term conjugate gradient projection algorithm for solving constrained monotone nonlinear equations. The global convergence of the algorithm was established under suitable assumptions.
Auwal Bala Abubakar +2 more
doaj
A new convergence proof for the higher-order power method and generalizations [PDF]
, 2015 A proof for the point-wise convergence of the factors in the higher-order power method for tensors towards a critical point is given. It is obtained by applying established results from the theory of \L{}ojasiewicz inequalities to the equivalent ...
Uschmajew, André
core
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
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
A fast continuous time approach with time scaling for nonsmooth convex optimization. [PDF]
Adv Contin Discret Model, 2022 Boţ RI, Karapetyants MA.
europepmc +1 more source
PONTRYAGIN PRINCIPLES IN INFINITE HORIZON IN PRESENCE OF ASYMPTOTICAL CONSTRAINTS
, 2015 We establish necessary conditions of optimality for discrete-time infinite-horizon optimal control in presence of constraints at infinity. These necessary conditions are in form of weak and strong Pontryagin principles.
Blot, Joël, Ngo, Thoi-Nhan
core +2 more sources
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
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
Fast Augmented Lagrangian Method in the convex regime with convergence guarantees for the iterates. [PDF]
Math Program, 2023 Boţ RI, Csetnek ER, Nguyen DK.
europepmc +1 more source
Discrete time pontryagin principles in banach spaces
, 2017 The aim of this paper is to establish Pontryagin's principles in a dicrete-time infinite-horizon setting when the state variables and the control variables belong to infinite dimensional Banach spaces. In comparison with previous results on this question,
Bachir, Mohammed, Blot, Joël
core