Alexey F. Izmailov
Orcid: 0000-0001-9851-0524
According to our database1,
Alexey F. Izmailov
authored at least 61 papers
between 2001 and 2023.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
Online presence:
-
on orcid.org
On csauthors.net:
Bibliography
2023
Comput. Optim. Appl., July, 2023
Stability of Singular Solutions of Nonlinear Equations with Restricted Smoothness Assumptions.
J. Optim. Theory Appl., March, 2023
2022
Perturbed Augmented Lagrangian Method Framework with Applications to Proximal and Smoothed Variants.
J. Optim. Theory Appl., 2022
2021
Math. Program., 2021
Accelerating convergence of a globalized sequential quadratic programming method to critical Lagrange multipliers.
Comput. Optim. Appl., 2021
Accelerating convergence of the globalized Newton method to critical solutions of nonlinear equations.
Comput. Optim. Appl., 2021
Comput. Optim. Appl., 2021
2020
SIAM J. Optim., 2020
SIAM J. Optim., 2020
J. Optim. Theory Appl., 2020
2019
Local Attractors of Newton-Type Methods for Constrained Equations and Complementarity Problems with Nonisolated Solutions.
J. Optim. Theory Appl., 2019
A globally convergent Levenberg-Marquardt method for equality-constrained optimization.
Comput. Optim. Appl., 2019
2018
Math. Program., 2018
A globally convergent LP-Newton method for piecewise smooth constrained equations: escaping nonstationary accumulation points.
Comput. Optim. Appl., 2018
2017
2016
Some new facts about sequential quadratic programming methods employing second derivatives.
Optim. Methods Softw., 2016
Globalizing Stabilized Sequential Quadratic Programming Method by Smooth Primal-Dual Exact Penalty Function.
J. Optim. Theory Appl., 2016
Convergence conditions for Newton-type methods applied to complementarity systems with nonisolated solutions.
Comput. Optim. Appl., 2016
2015
Some composite-step constrained optimization methods interpreted via the perturbed sequential quadratic programming framework.
Optim. Methods Softw., 2015
Math. Program., 2015
Comput. Optim. Appl., 2015
Local convergence of the method of multipliers for variational and optimization problems under the noncriticality assumption.
Comput. Optim. Appl., 2015
2014
Comput. Optim. Appl., 2014
2013
A note on upper Lipschitz stability, error bounds, and critical multipliers for Lipschitz-continuous KKT systems.
Math. Program., 2013
2012
Global Convergence of Augmented Lagrangian Methods Applied to Optimization Problems with Degenerate Constraints, Including Problems with Complementarity Constraints.
SIAM J. Optim., 2012
Semismooth Newton method for the lifted reformulation of mathematical programs with complementarity constraints.
Comput. Optim. Appl., 2012
Comput. Optim. Appl., 2012
2011
Semismooth SQP method for equality-constrained optimization problems with an application to the lifted reformulation of mathematical programs with complementarity constraints.
Optim. Methods Softw., 2011
On attraction of linearly constrained Lagrangian methods and of stabilized and quasi-Newton SQP methods to critical multipliers.
Math. Program., 2011
2010
SIAM J. Optim., 2010
Sharp Primal Superlinear Convergence Results for Some Newtonian Methods for Constrained Optimization.
SIAM J. Optim., 2010
Inexact Josephy-Newton framework for generalized equations and its applications to local analysis of Newtonian methods for constrained optimization.
Comput. Optim. Appl., 2010
2009
On attraction of Newton-type iterates to multipliers violating second-order sufficiency conditions.
Math. Program., 2009
Mathematical Programs with Vanishing Constraints: Optimality Conditions, Sensitivity, and a Relaxation Method.
J. Optimization Theory and Applications, 2009
Examples of dual behaviour of Newton-type methods on optimization problems with degenerate constraints.
Comput. Optim. Appl., 2009
2008
An Active-Set Newton Method for Mathematical Programs with Complementarity Constraints.
SIAM J. Optim., 2008
Necessary optimality conditions for constrained optimization problems under relaxed constraint qualifications.
Math. Program., 2008
2007
2006
Math. Oper. Res., 2006
2005
SIAM J. Optim., 2005
Sensitivity Analysis for Cone-Constrained Optimization Problems Under the Relaxed Constraint Qualifications.
Math. Oper. Res., 2005
Math. Methods Oper. Res., 2005
2004
SIAM J. Optim., 2004
Math. Program., 2004
2003
Karush-Kuhn-Tucker systems: regularity conditions, error bounds and a class of Newton-type methods.
Math. Program., 2003
2002
Superlinearly Convergent Algorithms for Solving Singular Equations and Smooth Reformulations of Complementarity Problems.
SIAM J. Optim., 2002
SIAM J. Optim., 2002
SIAM J. Control. Optim., 2002
SIAM J. Control. Optim., 2002
The Theory of 2-Regularity for Mappings with Lipschitzian Deriatives and its Applications to Optimality Conditions.
Math. Oper. Res., 2002
Proceedings of the 41st IEEE Conference on Decision and Control, 2002
2001
SIAM J. Numer. Anal., 2001
Error bounds for 2-regular mappings with Lipschitzian derivatives and their applications.
Math. Program., 2001