Gradient-type methods: a unified perspective in computer science and numerical analysis (Q420252): Difference between revisions

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

MaRDI profile type

MaRDI publication profile

0 references

full work available at URL

https://doi.org/10.5402/2011/715748

0 references

cites work

Q3995754

0 references

Q4821526

0 references

Interior Methods for Nonlinear Optimization

0 references

Matrix algebras in quasi-Newton methods for unconstrained minimization

0 references

Low‐complexity minimization algorithms

0 references

Low complexity secant quasi-Newton minimization algorithms for nonconvex functions

0 references

Hartley-type algebras in displacement and optimization strategies.

0 references

A new algorithm for box-constrained global optimization

0 references

Q4422519

0 references

TT-cross approximation for multidimensional arrays

0 references

Terminal repeller unconstrained subenergy tunneling (TRUST) for fast global optimization

0 references

A unifying approach to the construction of circulant preconditioners

0 references

A continuous approach to nonlinear integer programming

0 references

Numerical Optimization

0 references

0 references

0 references

0 references

0 references

0 references

0 references

The Gradient Projection Method for Nonlinear Programming. Part I. Linear Constraints

0 references

A new polynomial-time algorithm for linear programming

0 references

Conical projection algorithms for linear programming

0 references

A finite steps algorithm for solving convex feasibility problems

0 references

On Projection Algorithms for Solving Convex Feasibility Problems

0 references

Semidefinite Programming

0 references

Deterministic global optimization. Theory, methods and applications

0 references

Primal-relaxed dual global optimization approach

0 references

Incomplete cross approximation in the mosaic-skeleton method

0 references

Global Continuation for Distance Geometry Problems

0 references

Identifiers

zbMATH Open document ID

1238.65054

0 references

DOI

10.5402/2011/715748

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:420252

@@ 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.
+Normal rank
@@ Property / Mathematics Subject Classification ID @@
+K05
@@ Property / Mathematics Subject Classification ID: 65K05 / rank @@
+Normal rank
@@ Property / zbMATH DE Number @@
+6037046
@@ Property / zbMATH DE Number: 6037046 / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.5402/2011/715748
+Normal rank
@@ Property / OpenAlex ID @@
+W2038361810
@@ Property / OpenAlex ID: W2038361810 / rank @@
+Normal rank
@@ Property / Wikidata QID @@
+Q58689535
@@ Property / Wikidata QID: Q58689535 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3995754
@@ Property / cites work: Q3995754 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4821526
@@ Property / cites work: Q4821526 / rank @@
+Normal rank
@@ Property / cites work @@
+Interior Methods for Nonlinear Optimization
@@ Property / cites work: Interior Methods for Nonlinear Optimization / rank @@
+Normal rank
@@ Property / cites work @@
+Matrix algebras in quasi-Newton methods for unconstrained minimization
+Normal rank
@@ Property / cites work @@
+Low‐complexity minimization algorithms
@@ Property / cites work: Low‐complexity minimization algorithms / rank @@
+Normal rank
@@ Property / cites work @@
+Low complexity secant quasi-Newton minimization algorithms for nonconvex functions
+Normal rank
@@ Property / cites work @@
+Hartley-type algebras in displacement and optimization strategies.
+Normal rank
@@ Property / cites work @@
+A new algorithm for box-constrained global optimization
+Normal rank
@@ Property / cites work @@
+Q4422519
@@ Property / cites work: Q4422519 / rank @@
+Normal rank
@@ Property / cites work @@
+TT-cross approximation for multidimensional arrays
+Normal rank
@@ Property / cites work @@
+Terminal repeller unconstrained subenergy tunneling (TRUST) for fast global optimization
+Normal rank
@@ Property / cites work @@
+A unifying approach to the construction of circulant preconditioners
+Normal rank
@@ Property / cites work @@
+A continuous approach to nonlinear integer programming
+Normal rank
@@ Property / cites work @@
+Numerical Optimization
@@ Property / cites work: Numerical Optimization / rank @@
+Normal rank
@@ Property / cites work @@
+Q5657580
@@ Property / cites work: Q5657580 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4868581
@@ Property / cites work: Q4868581 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3759824
@@ Property / cites work: Q3759824 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3688092
@@ Property / cites work: Q3688092 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4107408
@@ Property / cites work: Q4107408 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3738922
@@ Property / cites work: Q3738922 / rank @@
+Normal rank
@@ Property / cites work @@
+The Gradient Projection Method for Nonlinear Programming. Part I. Linear Constraints
+Normal rank
@@ Property / cites work @@
+A new polynomial-time algorithm for linear programming
+Normal rank
@@ Property / cites work @@
+Conical projection algorithms for linear programming
+Normal rank
@@ Property / cites work @@
+A finite steps algorithm for solving convex feasibility problems
+Normal rank
@@ Property / cites work @@
+On Projection Algorithms for Solving Convex Feasibility Problems
+Normal rank
@@ Property / cites work @@
+Semidefinite Programming
@@ Property / cites work: Semidefinite Programming / rank @@
+Normal rank
@@ Property / cites work @@
+Deterministic global optimization. Theory, methods and applications
+Normal rank
@@ Property / cites work @@
+Primal-relaxed dual global optimization approach
@@ Property / cites work: Primal-relaxed dual global optimization approach / rank @@
+Normal rank
@@ Property / cites work @@
+Incomplete cross approximation in the mosaic-skeleton method
+Normal rank
@@ Property / cites work @@
+Global Continuation for Distance Geometry Problems
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:420252