( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
A lower bound on the iterative complexity of the Harker and Pang globalization technique of the Newton-min algorithm for solving the linear complementarity problem.

, , и . EURO J. Comput. Optim., 7 (4): 359-380 (2019)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed.

Jean-Charles Boisson

Jean-Charles Profizi

Jean Charles Munch

Jean-Charles Tournier

Jean-Charles Huet

 

Другие публикации лиц с тем же именем

On the Realization of the Wolfe Conditions in Reduced Quasi-Newton Methods for Equality Constrained Optimization.. SIAM J. Optimization, 7 (3): 780-813 (1997)A family of variable metric proximal methods., , , и . Math. Program., (1995)An Algorithmic Characterization of P-Matricity., и . SIAM J. Matrix Anal. Appl., 34 (3): 904-916 (2013)LIBOPT - An environment for testing solvers on heterogeneous collections of problems - Version 1.0, и . CoRR, (2007)A BFGS-IP algorithm for solving strongly convex optimization problems with feasibility enforced by an exact penalty approach., , и . Math. Program., 92 (3): 393-424 (2002)A trust region method based on interior point techniques for nonlinear programming., , и . Math. Program., 89 (1): 149-185 (2000)A Feasible BFGS Interior Point Algorithm for Solving Convex Minimization Problems., , и . SIAM J. Optimization, 11 (1): 199-222 (2000)A Piecewise Line-Search Technique for Maintaining the Positive Definitenes of the Matrices in the SQP Method., и . Comput. Optim. Appl., 16 (2): 121-158 (2000)Global Convergence Properties of Conjugate Gradient Methods for Optimization., и . SIAM J. Optimization, 2 (1): 21-42 (1992)Some numerical experiments with variable-storage quasi-Newton algorithms., и . Math. Program., 45 (1-3): 407-435 (1989)