Gradient-type methods: a unified perspective in computer science and numerical analysis (Q420252): Difference between revisions
From MaRDI portal
Created a new Item |
ReferenceBot (talk | contribs) Changed an Item |
||
(5 intermediate revisions by 5 users not shown) | |||
Property / review text | |||
Summary: We present a general and comprehensive description of Optimization Methods, and Algorithms from a novel viewpoint. It is shown, in particular, that Direct Methods, Iterative Methods, and Computer Science Algorithms belong to a well-defined general class of both finite and infinite procedures, characterized by suitable descent directions. | |||
Property / review text: Summary: We present a general and comprehensive description of Optimization Methods, and Algorithms from a novel viewpoint. It is shown, in particular, that Direct Methods, Iterative Methods, and Computer Science Algorithms belong to a well-defined general class of both finite and infinite procedures, characterized by suitable descent directions. / rank | |||
Normal rank | |||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 65K05 / rank | |||
Normal rank | |||
Property / zbMATH DE Number | |||
Property / zbMATH DE Number: 6037046 / rank | |||
Normal rank | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.5402/2011/715748 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2038361810 / rank | |||
Normal rank | |||
Property / Wikidata QID | |||
Property / Wikidata QID: Q58689535 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3995754 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4821526 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Interior Methods for Nonlinear Optimization / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Matrix algebras in quasi-Newton methods for unconstrained minimization / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Low‐complexity minimization algorithms / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Low complexity secant quasi-Newton minimization algorithms for nonconvex functions / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Hartley-type algebras in displacement and optimization strategies. / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A new algorithm for box-constrained global optimization / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4422519 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: TT-cross approximation for multidimensional arrays / 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 unifying approach to the construction of circulant preconditioners / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A continuous approach to nonlinear integer programming / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Numerical Optimization / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5657580 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4868581 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3759824 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3688092 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4107408 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3738922 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: The Gradient Projection Method for Nonlinear Programming. Part I. Linear Constraints / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A new polynomial-time algorithm for linear programming / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Conical projection algorithms for linear programming / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A finite steps algorithm for solving convex feasibility problems / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On Projection Algorithms for Solving Convex Feasibility Problems / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Semidefinite Programming / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Deterministic global optimization. Theory, methods and applications / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Primal-relaxed dual global optimization approach / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Incomplete cross approximation in the mosaic-skeleton method / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Global Continuation for Distance Geometry Problems / rank | |||
Normal rank | |||
links / mardi / name | links / mardi / name | ||
Latest revision as of 06:45, 5 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Gradient-type methods: a unified perspective in computer science and numerical analysis |
scientific article |
Statements
Gradient-type methods: a unified perspective in computer science and numerical analysis (English)
0 references
21 May 2012
0 references
Summary: We present a general and comprehensive description of Optimization Methods, and Algorithms from a novel viewpoint. It is shown, in particular, that Direct Methods, Iterative Methods, and Computer Science Algorithms belong to a well-defined general class of both finite and infinite procedures, characterized by suitable descent directions.
0 references
0 references