Zum Inhalt springen

Suchergebnisse

  • Rainer Tichatschke (Kategorie Rektor einer Hochschule in Deutschland)
    Mitglied der American Mathematical Society (AMS). Proximal Point Methods for Variational Problems, Monograph, 2011 Proximal point methods in nonconvex optimization…
    6 KB (607 Wörter) - 10:38, 24. Nov. 2024

Suchergebnisse von der englischsprachigen Wikipedia.

  • Proximal gradient (forward backward splitting) methods for learning is an area of research in optimization and statistical learning theory which studies…
    20 KB (3.193 Wörter) - 21:03, 13. Mai 2024
  • Powell in 1969. The method was studied by R. Tyrrell Rockafellar in relation to Fenchel duality, particularly in relation to proximal-point methods, Moreau–Yosida…
    15 KB (1.940 Wörter) - 08:08, 22. Apr. 2025
  • Convex optimization (Weiterleitung von „Convex programming“)
    0: Recent improvements to a modeling language for mathematical optimization". Mathematical Programming Computation. arXiv:2206.03866. doi:10.1007/s12532-023-00239-3…
    30 KB (3.166 Wörter) - 16:51, 10. Mai 2025
  • Gradient descent (Weiterleitung von „Gradient descent method“)
    Gradient descent is a method for unconstrained mathematical optimization. It is a first-order iterative algorithm for minimizing a differentiable multivariate…
    39 KB (5.587 Wörter) - 23:14, 5. Mai 2025
  • Policy gradient methods are a class of reinforcement learning algorithms. Policy gradient methods are a sub-class of policy optimization methods. Unlike value-based…
    31 KB (6.294 Wörter) - 04:45, 13. Apr. 2025
  • Chambolle-Pock algorithm (Kategorie Optimization algorithms and methods)
    for simultaneous updates of primal and dual variables. By employing the proximal operator, the Chambolle-Pock algorithm efficiently handles non-smooth and…
    21 KB (2.970 Wörter) - 10:21, 13. Dez. 2024
  • Stochastic variance reduction (Weiterleitung von „Point-SAGA“)
    Accelerated variance reduction methods are built upon the standard methods above. The earliest approaches make use of proximal operators to accelerate convergence…
    12 KB (1.858 Wörter) - 20:27, 1. Okt. 2024
  • Contraction mapping (Kategorie Fixed points (mathematics))
    in Hilbert Spaces. New York: Springer. Combettes, Patrick L. (July 2018). "Monotone operator theory in convex optimization". Mathematical Programming
    9 KB (1.120 Wörter) - 22:11, 8. Jan. 2025
  • List of numerical analysis topics (Kategorie Mathematics-related lists)
    level sets Sinc numerical methodsmethods based on the sinc function, sinc(x) = sin(x) / x ABS methods Error analysis (mathematics) Approximation Approximation…
    70 KB (8.335 Wörter) - 22:20, 17. Apr. 2025
  • Polyak, B. T. (1966). "Constrained minimization methods". USSR Computational Mathematics and Mathematical Physics. 6 (5): 1. doi:10.1016/0041-5553(66)90114-5…
    8 KB (1.200 Wörter) - 21:37, 11. Jul. 2024
  • R. Tyrrell Rockafellar (Kategorie American mathematical analysts)
    "Augmented Lagrangians and applications of the proximal point algorithm in convex programming". Mathematics of Operations Research. 1 (2): 97–116. CiteSeerX 10…
    20 KB (2.039 Wörter) - 15:22, 5. Mai 2025
  • Pierre-Louis Lions (Kategorie French mathematical analysts)
    Douglas–Rachford splitting method and the proximal point algorithm for maximal monotone operators". Mathematical Programming. Series A. 55 (3): 293–318…
    29 KB (2.101 Wörter) - 18:24, 12. Apr. 2025
  • classical dynamic programming methods and reinforcement learning algorithms is that the latter do not assume knowledge of an exact mathematical model of the…
    69 KB (8.193 Wörter) - 05:57, 12. Mai 2025
  • Outline of statistics (Kategorie Mathematics-related lists)
    quadratic program Second-order cone programming Semidefinite programming Newton-Raphson Gradient descent Conjugate gradient method Mirror descent Proximal gradient…
    9 KB (753 Wörter) - 14:06, 11. Apr. 2024
  • Backtracking line search (Kategorie Optimization algorithms and methods)
    descent methods for semi-algebraic and tame problems: proximal algorithms, forward–backward splitting, and regularized Gauss–Seidel methods". Mathematical Programming…
    29 KB (4.564 Wörter) - 19:39, 19. Mär. 2025
  • Least squares (Weiterleitung von „Method of least squares“)
    direct methods, although problems with large numbers of parameters are typically solved with iterative methods, such as the Gauss–Seidel method. In LLSQ…
    39 KB (5.601 Wörter) - 16:31, 24. Apr. 2025
  • Svaiter, B. F.; Teboulle, Marc (1994). "Entropy-like proximal methods in convex programming". Mathematics of Operations Research. 19 (4): 790–814. doi:10.1287/moor…
    5 KB (222 Wörter) - 12:04, 19. Nov. 2023
  • optimization problems solved via dynamic programming and reinforcement learning. mathematical optimization In mathematics, computer science, and operations research…
    270 KB (29.481 Wörter) - 13:14, 23. Jan. 2025
  • anyone wishing to enter into the analysis or deconstruction of methods". The methods of teaching language may be characterized into three principal views:…
    42 KB (5.645 Wörter) - 09:46, 10. Mai 2024
  • DeepSeek (Kategorie All Wikipedia articles written in American English)
    Li, Y. K. (27 April 2024), DeepSeekMath: Pushing the Limits of Mathematical Reasoning in Open Language Models, arXiv:2402.03300. DeepSeek-AI; Zhu, Qihao;…
    62 KB (6.069 Wörter) - 13:50, 13. Mai 2025
  • superior capabilities in domains requiring structured logical thinking, such as mathematics, scientific research, and computer programming. Efforts to reduce…
    114 KB (11.944 Wörter) - 07:47, 12. Mai 2025