The following pages link to Nguyen Thai An (Q1937002):
Displaying 10 items.
- Minimal time functions and the smallest intersecting ball problem with unbounded dynamics (Q1937003) (← links)
- Constructions of solutions to generalized Sylvester and Fermat-Torricelli problems for Euclidean balls (Q2251551) (← links)
- Smoothing algorithms for computing the projection onto a Minkowski sum of convex sets (Q2282820) (← links)
- Solving \(k\)-center problems involving sets based on optimization techniques (Q2301186) (← links)
- A D.C. Algorithm via Convex Analysis Approach for Solving a Location Problem Involving Sets (Q2814272) (← links)
- Convergence analysis of a proximal point algorithm for minimizing differences of functions (Q2977635) (← links)
- Clustering and multifacility location with constraints via distance function penalty methods and dc programming (Q4646536) (← links)
- Smoothing techniques and difference of convex functions algorithms for image reconstructions (Q5131820) (← links)
- Nonsmooth Algorithms and Nesterov's Smoothing Technique for Generalized Fermat--Torricelli Problems (Q5245367) (← links)
- Characterizations of weak sharp solutions for variational inequalities on Hadamard manifolds and applications (Q6065197) (← links)
