Francisco Facchinei's home page

Professor of Operations Research

Dipartimento di Informatica e Sistemistica
Universita' di Roma "La Sapienza"
Via Buonarroti 12, 00185
Roma, Italia

Telephone: (+39) 06 48299-226
Fax: (+39 06 47825618
Email: soler@dis.uniroma1.it

Interests: Unconstrained and Constrained Optimization, Nonsmooth Optimization, Complementarity Problems.

Publications since 1994

Click here to get general information about the following papers:

The semismooth algorithm for large scale complementarity problems .
A truncated Newton algorithm for large scale box constrained optimization .
Total stability of variational inequalities.
On the identification of zero variables in an interior-point framework.
On the identification of zero variables in an interior-point framework: Complete numerical results.
A theoretical and numerical comparison of some semismooth algorithms for complementarity problems.
Structural and stability properties of P0 nonlinear complementarity problems.
Beyond monotonicity in regularization methods for nonlinear complementarity problems.
Exact penalization via Dini and Hadamard conditional derivatives.
A simply constrained optimization reformulation of KKT systems arising from variational inequalities.
Convergence to second order stationary points in inequality constrained optimization.
On the accurate identification of active constraints.
A smoothing method for mathematical programs with equilibrium constraints.
An unconstrained minimization approach to the solution of optimization problems with simple bounds .
A semismooth Newton method for variational inequalities: Theoretical results and preliminary numerical experience .
A semismooth Newton method for variational inequalities: The case of box constraints .
Inexact Newton methods for semismooth equations with applications to variational inequality problems .
When are the (un)constrained stationary points of the implicit Lagrangian global solutions? .
A nonsmooth inexact Newton method for the solution of large-scale nonlinear complementarity problems .
On the convergenge to a unique point of minimization algorithms .
Exact barrier function methods for Lipschitz programs .
An active set Newton's algorithm for large-scale nonlinear programs with box constraints .
A semismooth equation approach to the solution of nonlinear complementarity problems.
Testing a new class of algorithms for nonlinear complementarity problems.
Quadratically and superlinearly convergent algorithms for the solution of inequality constrained minimization problems.
A Newton-like algorithm for the solution of inequality constrained minimization problems.
A new merit function for the solution of nonlinear complementarity problems and a related algorithm.
Minimization of SC1 functions and the Maratos effect.

Didattica

(In Italian)

Curriculum

(In Italian)

Click here to go back to the Home Page of:

last updated 16 september 1999