The following pages link to Francisco J. Aragón Artacho (Q288227):
Displaying 33 items.
- Global behavior of the Douglas-Rachford method for a nonconvex feasibility problem (Q288229) (← links)
- Walking on real numbers (Q354142) (← links)
- Recent results on Douglas-Rachford methods for combinatorial optimization problems (Q467464) (← links)
- Applications of convex analysis within mathematics (Q484128) (← links)
- Enhanced metric regularity and Lipschitzian properties of variational systems (Q539508) (← links)
- A new projection method for finding the closest point in the intersection of convex sets (Q683336) (← links)
- A Lyusternik-Graves theorem for the proximal point method (Q694520) (← links)
- (Q878246) (redirect page) (← links)
- On the inner and outer norms of sublinear mappings (Q878247) (← links)
- Solving graph coloring problems with the Douglas-Rachford algorithm (Q1653324) (← links)
- Accelerating the DC algorithm for smooth functions (Q1749446) (← links)
- A feasibility approach for constructing combinatorial designs of circulant type (Q1752612) (← links)
- Globally convergent algorithms for finding zeros of duplomonotone mappings (Q2018870) (← links)
- The superiorization method with restarted perturbations for split minimization problems with an application to radiotherapy treatment planning (Q2101916) (← links)
- A direct proof of convergence of Davis-Yin splitting algorithm allowing larger stepsizes (Q2158832) (← links)
- An enhanced formulation for solving graph coloring problems with the Douglas-Rachford algorithm (Q2176284) (← links)
- The Douglas-Rachford algorithm for convex and nonconvex feasibility problems (Q2189471) (← links)
- Using positive spanning sets to achieve d-stationarity with the boosted DC algorithm (Q2189634) (← links)
- Correction to: ``Using positive spanning sets to achieve d-stationarity with the boosted DC algorithm'' (Q2189635) (← links)
- Strengthened splitting methods for computing resolvents (Q2231047) (← links)
- Optimal rates of linear convergence of the averaged alternating modified reflections method for two subspaces (Q2274154) (← links)
- Local convergence of the Levenberg-Marquardt method under Hölder metric subregularity (Q2305550) (← links)
- Computing the resolvent of the sum of maximally monotone operators with the averaged alternating modified reflections algorithm (Q2420809) (← links)
- Global convergence of a non-convex Douglas-Rachford iteration (Q2434636) (← links)
- A new and self-contained proof of Borwein's norm duality theorem (Q2460928) (← links)
- Uniformity and inexact version of a proximal method for metrically regular mappings (Q2642106) (← links)
- Metric regularity and Lipschitzian stability of parametric variational systems (Q2653938) (← links)
- The boosted DC algorithm for linearly constrained DC programming (Q2677660) (← links)
- A primal-dual splitting algorithm for composite monotone inclusions with minimal lifting (Q2700012) (← links)
- DOUGLAS–RACHFORD FEASIBILITY METHODS FOR MATRIX COMPLETION PROBLEMS (Q2925693) (← links)
- Metric Regularity of Newton's Iteration (Q3021253) (← links)
- Convergence of the Proximal Point Method for Metrically Regular Mappings (Q5427501) (← links)
- Distributed forward-backward methods for ring networks (Q6146367) (← links)
