On the Halley class of methods for unconstrainedoptimization problems (Q3161140): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1080/10556780902951643 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1997921819 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Automatic differentiation of algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: An acceleration of Newton's method: Super-Halley method / rank
 
Normal rank
Property / cites work
 
Property / cites work: The polyadic structure of factorable function tensors with applications to high-order minimization techniques / rank
 
Normal rank
Property / cites work
 
Property / cites work: A generalized Newton algorithm using higher-order derivatives / rank
 
Normal rank
Property / cites work
 
Property / cites work: Testing Unconstrained Optimization Software / rank
 
Normal rank
Property / cites work
 
Property / cites work: Automatic differentiation: techniques and applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: A simple automatic derivative evaluation program / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the method of tangent hyperbolas in Banach spaces / rank
 
Normal rank
Property / cites work
 
Property / cites work: Historical developments in convergence analysis for Newton's and Newton-like methods / rank
 
Normal rank

Latest revision as of 08:17, 3 July 2024

scientific article
Language Label Description Also known as
English
On the Halley class of methods for unconstrainedoptimization problems
scientific article

    Statements