A gradually descent method for discrete global optimization (Q5436248): 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.1007/s11741-007-0106-1 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1966080235 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Introduction to global optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Tunneling Algorithm for the Global Minimization of Functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Terminal repeller unconstrained subenergy tunneling (TRUST) for fast global optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: A filled function method for finding a global minimizer of a function of several variables / rank
 
Normal rank
Property / cites work
 
Property / cites work: The globally convexized filled functions for global optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Revised filled function methods for global optimization. / rank
 
Normal rank
Property / cites work
 
Property / cites work: New classes of globally convexized filled functions for global optimization / rank
 
Normal rank

Latest revision as of 15:12, 27 June 2024

scientific article; zbMATH DE number 5226828
Language Label Description Also known as
English
A gradually descent method for discrete global optimization
scientific article; zbMATH DE number 5226828

    Statements

    Identifiers