Publications (in journals)
as of November 2011other communications (conf', talks,...) available upon request
- On the bridge between combinatorial optimization and nonlinear optimization: a family of semidefinite bounds for 0-1 quadratic problems leading to quasi-Newton methodsUnder final revision to Mathematical Programming (2011) [preprint coming soon]
- Projection-like retractions on matrix manifoldsTo appear in SIAM Journal on Optimization (2011) [preprint]
- Solving k-cluster to optimality with semidefinite programmingTo appear in Mathematical Programming (2011) [preprint]
- A fresh variational-analysis look at the positive semidefinite matrices worldTo appear in Journal of Optimization Theory and Applications (2011) [preprint]
- Inexact proximal algorithms for differentiable optimizationUnder revision to Computational Optimization and Applications (2009) [preprint]
- A formulation of the linear discrete Coulomb friction problem via convex optimization"ZAMM" Journal of Applied Mathematics & Mechanics (2010) [paper]
- Projection methods in conic optimizationTo appear in Handbook of Semidefinite, Conic and Polynomial Optimization (2010) [preprint]
- Existence of a fixed point of a nonsmooth function arising in numerical mechanics
- Numerical Study of Semidefinite Bounds for the k-cluster Problem
- Locally symmetric manifolds lift up to spectral manifoldsSubmitted to Advances in Maths (2009) [preprint]
- Projection methods for conic feasibility problems;
applications to sum-of-squares decompositionsOptimization Methods and Software (2009) [paper] - Regularization methods for semidefinite programming
- Local convergence of nonconvex averaged and alternating projections
- Prox-regularity of spectral functions and spectral sets
- Alternating projections on manifolds
- Spherical constraint in Boolean quadratic programming
- Geometrical interpretation of the proximal-type algorithms in structured optimization problems
- Clarke Generalized Jacobian of the Projection onto the Cone of Positive Semidefinite Matrices
- U-Newton methods for nonsmooth convex minimization
- Filling the gap between lower-C1 and lower-C2 functionsJournal of Convex Analysis (2005) [paper]
- A dual approach to semidefinite least-squares problemsSIAM Journal of Matrix Analysis and Applications (2004) [paper]