Francisco J. Aragón Artacho

Orcid: 0000-0002-2445-8011

According to our database1, Francisco J. Aragón Artacho authored at least 33 papers between 2011 and 2026.

Collaborative distances:

Timeline

Legend:

Book  In proceedings  Article  PhD thesis  Dataset  Other 

Links

Online presence:

On csauthors.net:

Bibliography

2026
A comparative numerical study of graph-based splitting algorithms for linear subspaces.
CoRR, March, 2026

2025
The Boosted Double-proximal Subgradient Algorithm for nonconvex optimization.
Math. Program., November, 2025

Nonmonotone subgradient methods based on a local descent lemma.
CoRR, October, 2025

Coderivative-based semi-Newton method in nonsmooth difference programming.
Math. Program., September, 2025

Forward-Backward Algorithms Devised by Graphs.
SIAM J. Optim., 2025

2024
Approaches to iterative algorithms for solving nonlinear equations with an application in tomographic absorption spectroscopy.
CoRR, 2024

Corrigendum to: "The superiorization method with restarted perturbations for split minimization problems with an application to radiotherapy treatment planning" [Appl. Math. Comput. 440 (2023) 127627].
Appl. Math. Comput., 2024

2023
Distributed forward-backward methods for ring networks.
Comput. Optim. Appl., December, 2023

A primal-dual splitting algorithm for composite monotone inclusions with minimal lifting.
Numer. Algorithms, May, 2023

The superiorization method with restarted perturbations for split minimization problems with an application to radiotherapy treatment planning.
Appl. Math. Comput., 2023

2021
Distributed Forward-Backward Methods without Central Coordination.
CoRR, 2021

Strengthened splitting methods for computing resolvents.
Comput. Optim. Appl., 2021

2020
The Boosted Difference of Convex Functions Algorithm for Nonsmooth Functions.
SIAM J. Optim., 2020

The Douglas-Rachford algorithm for convex and nonconvex feasibility problems.
Math. Methods Oper. Res., 2020

An enhanced formulation for solving graph coloring problems with the Douglas-Rachford algorithm.
J. Glob. Optim., 2020

2019
The cyclic Douglas-Rachford algorithm with r-sets-Douglas-Rachford operators.
Optim. Methods Softw., 2019

Optimal rates of linear convergence of the averaged alternating modified reflections method for two subspaces.
Numer. Algorithms, 2019

Computing the Resolvent of the Sum of Maximally Monotone Operators with the Averaged Alternating Modified Reflections Algorithm.
J. Optim. Theory Appl., 2019

Using positive spanning sets to achieve stationarity with the Boosted DC Algorithm.
CoRR, 2019

Local convergence of the Levenberg-Marquardt method under Hölder metric subregularity.
Adv. Comput. Math., 2019

2018
Accelerating the DC algorithm for smooth functions.
Math. Program., 2018

A feasibility approach for constructing combinatorial designs of circulant type.
J. Comb. Optim., 2018

The Boosted DC Algorithm for nonsmooth functions.
CoRR, 2018

A new projection method for finding the closest point in the intersection of convex sets.
Comput. Optim. Appl., 2018

2016
Global behavior of the Douglas-Rachford method for a nonconvex feasibility problem.
J. Glob. Optim., 2016

2015
Globally convergent algorithms for finding zeros of duplomonotone mappings.
Optim. Lett., 2015

2014
Applications of convex analysis within mathematics.
Math. Program., 2014

Recent Results on Douglas-Rachford Methods for Combinatorial Optimization Problems.
J. Optim. Theory Appl., 2014

Local convergence of quasi-Newton methods under metric regularity.
Comput. Optim. Appl., 2014

2013
Global convergence of a non-convex Douglas-Rachford iteration.
J. Glob. Optim., 2013

2012
A Lyusternik-Graves theorem for the proximal point method.
Comput. Optim. Appl., 2012

2011
Metric Regularity of Newton's Iteration.
SIAM J. Control. Optim., 2011

Enhanced metric regularity and Lipschitzian properties of variational systems.
J. Glob. Optim., 2011


  Loading...