Results 61 to 70 of about 174 (149)
Local convergence of tensor methods. [PDF]
Math Program, 2022 Doikov N, Nesterov Y.
europepmc +1 more source
Initial Results Of An Mdo Method Evaluation Study
, 1998 The NASA Langley MDO method evaluation study seeks to arrive at a set of guidelines for using promising MDO methods by accumulating and analyzing computational data for such methods.
Srinivas Kodiyalam Y +5 more
core +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.
Ngo, Thoi-Nhan, Blot, Joël
core
On the Finite Complexity of Solutions in a Degenerate System of Quadratic Equations: Exact Formula. [PDF]
Entropy (Basel), 2023 Brezhneva O +2 more
europepmc +1 more source
New Hybrid Conjugate Gradient Method as a Convex Combination of PRP and RMIL+ Methods
The Conjugate Gradient (CG) method is a powerful iterative approach for solving large-scale minimization problems, characterized by its simplicity, low computation cost and good convergence. In this paper, a new hybrid conjugate gradient HLB method (HLB:
BENZINE, Rachid +3 more
core +1 more source
Implementable tensor methods in unconstrained convex optimization. [PDF]
Math Program, 2021 Nesterov Y.
europepmc +1 more source
Forecasting the action of CAR-T cells against SARS-corona virus-II infection with branching process. [PDF]
Model Earth Syst Environ, 2022 Al-Utaibi KA +5 more
europepmc +1 more source
Joint minimization with alternating Bregman proximity operators
, 2006 International audienceA systematic study of the proximity properties of Bregman distances is carried out. This investigation leads to the introduction of a new type of proximity operator which complements the usual Bregman proximity operator.
Combettes, Patrick, L +4 more
core
On quasi-solution to infeasible linear complementarity problem obtained by Lemke’s method
Open Mathematics, 2004 Popov L.
doaj +1 more source
, 1997 . The Nelder-Mead algorithm can stagnate and converge to a non-optimal point, even for very simple problems. In this note we propose a test for sufficient decrease which, if passed for the entire iteration, will guarantee convergence of the Nelder-Mead ...
C. T. Kelley
core