The Douglas–Rachford algorithm for convex and nonconvex feasibility problems

The Douglas–Rachford algorithm is an optimization method that can be used for solving feasibility problems. To apply the method, it is necessary that the problem at hand is prescribed in terms of constraint sets having efficiently computable nearest points. Although the convergence of the algorithm...

Celý popis

Uloženo v:

Podrobná bibliografie
Vydáno v:	Mathematical methods of operations research (Heidelberg, Germany) Ročník 91; číslo 2; s. 201 - 240
Hlavní autoři:	Aragón Artacho, Francisco J., Campoy, Rubén, Tam, Matthew K.
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	Berlin/Heidelberg Springer Berlin Heidelberg 01.04.2020 Springer Nature B.V
Témata:	Algorithms Business and Management Calculus of Variations and Optimal Control; Optimization Combinatorial analysis Convergence Feasibility Mathematics Mathematics and Statistics Operations research Operations Research/Decision Theory Optimization Original Article 65K05 Projection methods Douglas–Rachford Eight queens problem 90C27 Feasibility problem 90-01 65-01
ISSN:	1432-2994, 1432-5217
On-line přístup:	Získat plný text
Tagy:	Přidat tag Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!

Buďte první, kdo okomentuje tento záznam!