Results 101 to 110 of about 231 (178)

$${{\mathcal {D}(\mathcal {C})}}$$ -optimization and robust global optimization

open access: yes
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

Finding a Strict Feasible Dual Initial Solution for Quadratic Semidefinite Programming

open access: yes, 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]

open access: yesNumer Algorithms, 2023
Aragón-Artacho FJ   +2 more
europepmc   +1 more source

The Graves Theorem Revisited II: Robust Convergence of the Newton Method [PDF]

open access: yes, 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  

Volume 3 (1996), No. 2, 195–205 Generalized Monotone Nonsmooth Maps

open access: yes, 1995
Recent characterizations of various types of differentiable generalized monotone maps by Karamardian– Schaible–Crouzeix and their strengthened versions by Crouzeix–Ferland are extended to the nonsmooth case.
S. Schaible, Dinh The Luc
core  

A non-monotone pattern search approach for systems of nonlinear equations. [PDF]

open access: yesInt J Comput Math, 2019
Amini K, Kimiaei M, Khotanlou H.
europepmc   +1 more source

Home - About - Disclaimer - Privacy