The Graves Theorem Revisited II: Robust Convergence of the Newton Method [PDF]
, 1998 AMS subject classification: 65J15, 47H04, 90C30.Based on the original proof of the Graves theorem [9] we study the convergence of the Newton method for the solution of the equation f (x) = y, uniform with respect to the starting point and the parameter y.
Dontchev, Asen
core
$${{\mathcal {D}(\mathcal {C})}}$$ -optimization and robust global optimization
Nonconvex global optimization, Approximate optimal solution, Robust approach, Essential optimal solution, dc optimization, dm (monotonic) optimization, $${{\mathcal {D}(\mathcal {C})}}$$ -optimization, Successive Incumbent Transcending Algorithm, 90C26 ...
Hoang Tuy
core +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 +2 more
core +2 more sources
Second order optimality conditions in nonsmooth unconstrained optimization. [PDF]
, 1998 AMS subject classification: 49J52, 90C30.Second order sufficient and necessary conditions are given for a nonsmooth function f defined in a Banach space to attain a minimum at a point in the interior of its domain.
GUERRAGGIO, ANGELO +2 more
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
Finding a Strict Feasible Dual Initial Solution for Quadratic Semidefinite Programming
, 2012 In this paper, we propose an algorithm to comput the dual initial feasible solution for solving a primal-dual optimization problem (convex quadratic semidefinite programming) by a interior point methods.
Lakhdar Djeffal, El Amir Djeffal
core
A primal-dual splitting algorithm for composite monotone inclusions with minimal lifting. [PDF]
Numer Algorithms, 2023 Aragón-Artacho FJ +2 more
europepmc +1 more source
A second-order dynamical approach with variable damping to nonconvex smooth minimization. [PDF]
Appl Anal, 2020 Boţ RI, Csetnek ER, László SC.
europepmc +1 more source
Necessary optimality conditions for a bilevel optimization problem are given in the paper by Kohli (J Optim Theory Appl 152: 632–651, 2012). Recently, the same author corrected his results in the note (J Optim Theory Appl 181:706–707, 2019). In this work,
Nazih Abderrazzak Gadhi
core +1 more source
A new multisection technique in interval methods for global optimization
, 2000 A new multisection technique in interval methods for global optimization is investigated, and numerical tests demonstrate that the e ciency of the underlying global optimization method can be improved substantially.
I. Garcõâ A +4 more
core +1 more source