Search Results - "Aragón Artacho, Francisco J."

A Direct Proof of Convergence of Davis–Yin Splitting Algorithm Allowing Larger Stepsizes by Aragón-Artacho, Francisco J., Torregrosa-Belén, David

“…This note is devoted to the splitting algorithm proposed by Davis and Yin (Set-valued Var. Anal. 25 (4), 829–858, 2017 ) for computing a zero of the sum of…”
Get full text

An enhanced formulation for solving graph coloring problems with the Douglas–Rachford algorithm by Aragón Artacho, Francisco J., Campoy, Rubén, Elser, Veit

“…We study the behavior of the Douglas–Rachford algorithm on the graph vertex-coloring problem. Given a graph and a number of colors, the goal is to find a…”
Get full text

Local convergence of the Levenberg–Marquardt method under Hölder metric subregularity by Ahookhosh, Masoud, Aragón Artacho, Francisco J., Fleming, Ronan M. T., Vuong, Phan T.

“…We describe and analyse Levenberg–Marquardt methods for solving systems of nonlinear equations. More specifically, we propose an adaptive formula for the…”
Get full text

Distributed forward-backward methods for ring networks by Aragón-Artacho, Francisco J., Malitsky, Yura, Tam, Matthew K., Torregrosa-Belén, David

“…In this work, we propose and analyse forward-backward-type algorithms for finding a zero of the sum of finitely many monotone operators, which are not based on…”
Get full text

A primal-dual splitting algorithm for composite monotone inclusions with minimal lifting by Aragón-Artacho, Francisco J., Boţ, Radu I., Torregrosa-Belén, David

“…In this work, we study resolvent splitting algorithms for solving composite monotone inclusion problems. The objective of these general problems is finding a…”
Get full text

The Douglas–Rachford algorithm for convex and nonconvex feasibility problems by Aragón Artacho, Francisco J., Campoy, Rubén, Tam, Matthew K.

“…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…”
Get full text

A new projection method for finding the closest point in the intersection of convex sets by Aragón Artacho, Francisco J., Campoy, Rubén

“…In this paper we present a new iterative projection method for finding the closest point in the intersection of convex sets to any arbitrary point in a Hilbert…”
Get full text

Recent Results on Douglas–Rachford Methods for Combinatorial Optimization Problems by Aragón Artacho, Francisco J., Borwein, Jonathan M., Tam, Matthew K.

“…We discuss recent positive experiences applying convex feasibility algorithms of Douglas–Rachford type to highly combinatorial and far from convex problems…”
Get full text

Global behavior of the Douglas–Rachford method for a nonconvex feasibility problem by Aragón Artacho, Francisco J., Borwein, Jonathan M., Tam, Matthew K.

“…In recent times the Douglas–Rachford algorithm has been observed empirically to solve a variety of nonconvex feasibility problems including those of a…”
Get full text

Global convergence of a non-convex Douglas–Rachford iteration by Aragón Artacho, Francisco J., Borwein, Jonathan M.

“…We establish a region of convergence for the proto-typical non-convex Douglas–Rachford iteration which finds a point on the intersection of a line and a…”
Get full text

Applications of convex analysis within mathematics by Aragón Artacho, Francisco J., Borwein, Jonathan M., Martín-Márquez, Victoria, Yao, Liangjin

“…In this paper, we study convex analysis and its theoretical applications. We first apply important tools of convex analysis to Optimization and to Analysis. We…”
Get full text

DOUGLAS–RACHFORD FEASIBILITY METHODS FOR MATRIX COMPLETION PROBLEMS by ARAGÓN ARTACHO, FRANCISCO J., BORWEIN, JONATHAN M., TAM, MATTHEW K.

“…In this paper, we give general recommendations for successful application of the Douglas–Rachford reflection method to convex and nonconvex real matrix…”
Get full text

Walking on Real Numbers by Aragón Artacho, Francisco J., Bailey, David H., Borwein, Jonathan M., Borwein, Peter B.

“…Artacho et al describe and exhibit uniform walks on various numbers, both rational and irrational, artificial and natural. They look at quantifying two of the…”
Get full text

Accelerating the DC algorithm for smooth functions by Aragón Artacho, Francisco J., Fleming, Ronan M. T., Vuong, Phan T.

“…We introduce two new algorithms to minimise smooth difference of convex (DC) functions that accelerate the convergence of the classical DC algorithm (DCA). We…”
Get full text

Computing the Resolvent of the Sum of Maximally Monotone Operators with the Averaged Alternating Modified Reflections Algorithm by Aragón Artacho, Francisco J., Campoy, Rubén

“…The averaged alternating modified reflections algorithm is a projection method for finding the closest point in the intersection of closed and convex sets to a…”
Get full text

Strengthened splitting methods for computing resolvents by Aragón Artacho, Francisco J., Campoy, Rubén, Tam, Matthew K.

“…In this work, we develop a systematic framework for computing the resolvent of the sum of two or more monotone operators which only activates each operator in…”
Get full text

The cyclic Douglas-Rachford algorithm with r-sets-Douglas-Rachford operators by Aragón Artacho, Francisco J., Censor, Yair, Gibali, Aviv

“…The Douglas-Rachford (DR) algorithm is an iterative procedure that uses sequential reflections onto convex sets and which has become popular for convex…”
Get full text

Optimal rates of linear convergence of the averaged alternating modified reflections method for two subspaces by Aragón Artacho, Francisco J., Campoy, Rubén

“…The averaged alternating modified reflections (AAMR) method is a projection algorithm for finding the closest point in the intersection of convex sets to any…”
Get full text

Solving Graph Coloring Problems with the Douglas-Rachford Algorithm by Aragón Artacho, Francisco J., Campoy, Rubén

“…We present the Douglas-Rachford algorithm as a successful heuristic for solving graph coloring problems. Given a set of colors, these types of problems consist…”
Get full text

A Lyusternik–Graves theorem for the proximal point method by Aragón Artacho, Francisco J., Gaydu, Michaël

“…We consider a generalized version of the proximal point algorithm for solving the perturbed inclusion y ∈ T ( x ), where y is a perturbation element near 0 and…”
Get full text