( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
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)

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.

Armand Lozano

Armand Schulte

Armand Mergen

Armand Hess

Armand Arui

 

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

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)Bounds on the number of vertices of perturbed polyhedra.. Ann. Oper. Res., 46-47 (2): 249-269 (1993)Limited memory solution of bound constrained convex quadratic problems arising in video games., , и . RAIRO Oper. Res., 41 (1): 19-34 (2007)Local Convergence Analysis of a Primal-Dual Method for Bound-Constrained Optimization Without SOSC., и . J. Optim. Theory Appl., 189 (1): 96-116 (2021)From global to local convergence of interior methods for nonlinear optimization., , и . Optim. Methods Softw., 28 (5): 1051-1080 (2013)Local path-following property of inexact interior methods in nonlinear programming., , и . Comput. Optim. Appl., 52 (1): 209-238 (2012)A Feasible BFGS Interior Point Algorithm for Solving Convex Minimization Problems., , и . SIAM J. Optimization, 11 (1): 199-222 (2000)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)An Augmented Lagrangian Method for Equality Constrained Optimization with Rapid Infeasibility Detection Capabilities., и . J. Optimization Theory and Applications, 181 (1): 197-215 (2019)An inexact proximal regularization method for unconstrained optimization., и . Math. Methods Oper. Res., 85 (1): 43-59 (2017)