Mikhail V. Solodov
Affiliations: National Institute for Pure and Applied Mathematics, Rio de Janeiro, Brazil
According to our database^{1},
Mikhail V. Solodov
authored at least 80 papers
between 1993 and 2021.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis OtherLinks
Online presence:

on w3.impa.br
On csauthors.net:
Bibliography
2021
Math. Program., 2021
A regularized smoothing method for fully parameterized convex problems with applications to convex and nonconvex twostage stochastic programming.
Math. Program., 2021
Accelerating convergence of the globalized Newton method to critical solutions of nonlinear equations.
Comput. Optim. Appl., 2021
Decomposition Algorithms for Some Deterministic and TwoStage Stochastic SingleLeader MultiFollower Games.
Comput. Optim. Appl., 2021
2020
Math. Program., 2020
Comput. Optim. Appl., 2020
2019
J. Optim. Theory Appl., 2019
Local Attractors of NewtonType Methods for Constrained Equations and Complementarity Problems with Nonisolated Solutions.
J. Optim. Theory Appl., 2019
A globally convergent LevenbergMarquardt method for equalityconstrained optimization.
Comput. Optim. Appl., 2019
2018
Math. Program., 2018
Critical solutions of nonlinear equations: local attraction for Newtontype methods.
Math. Program., 2018
A globally convergent LPNewton method for piecewise smooth constrained equations: escaping nonstationary accumulation points.
Comput. Optim. Appl., 2018
2016
SIAM J. Optim., 2016
Some new facts about sequential quadratic programming methods employing second derivatives.
Optim. Methods Softw., 2016
Math. Program., 2016
An approximation scheme for a class of riskaverse stochastic equilibrium problems.
Math. Program., 2016
Globalizing Stabilized Sequential Quadratic Programming Method by Smooth PrimalDual Exact Penalty Function.
J. Optim. Theory Appl., 2016
A proximal bundle method for nonsmooth nonconvex functions with inexact information.
Comput. Optim. Appl., 2016
Convergence conditions for Newtontype methods applied to complementarity systems with nonisolated solutions.
Comput. Optim. Appl., 2016
2015
Some compositestep constrained optimization methods interpreted via the perturbed sequential quadratic programming framework.
Optim. Methods Softw., 2015
J. Optim. Theory Appl., 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
A class of DantzigWolfe type decomposition methods for variational inequality problems.
Math. Program., 2014
On error bounds and Newtontype methods for generalized Nash equilibrium problems.
Comput. Optim. Appl., 2014
2013
A note on upper Lipschitz stability, error bounds, and critical multipliers for Lipschitzcontinuous 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
Local Convergence of Exact and Inexact Augmented Lagrangian Methods under the SecondOrder Sufficient Optimality Condition.
SIAM J. Optim., 2012
Math. Program., 2012
Semismooth Newton method for the lifted reformulation of mathematical programs with complementarity constraints.
Comput. Optim. Appl., 2012
Solving generation expansion planning problems with environmental constraints by a bundle method.
Comput. Manag. Sci., 2012
2011
Semismooth SQP method for equalityconstrained 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 quasiNewton 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
Stabilized sequential quadratic programming for optimization and a stabilized Newtontype method for variational problems.
Math. Program., 2010
Inexact JosephyNewton framework for generalized equations and its applications to local analysis of Newtonian methods for constrained optimization.
Comput. Optim. Appl., 2010
2009
Proceedings of the Encyclopedia of Optimization, Second Edition, 2009
SIAM J. Optim., 2009
Global convergence of an SQP method without boundedness assumptions on any of the iterative sequences.
Math. Program., 2009
Math. Program., 2009
On attraction of Newtontype iterates to multipliers violating secondorder 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 Newtontype methods on optimization problems with degenerate constraints.
Comput. Optim. Appl., 2009
2008
SIAM J. Optim., 2008
An ActiveSet Newton Method for Mathematical Programs with Complementarity Constraints.
SIAM J. Optim., 2008
On local convergence of sequential quadraticallyconstrained quadraticprogramming type methods, with an extension to variational problems.
Comput. Optim. Appl., 2008
2007
SIAM J. Optim., 2007
2005
An Infeasible Bundle Method for Nonsmooth Convex Constrained Optimization without a Penalty Function or a Filter.
SIAM J. Optim., 2005
SIAM J. Optim., 2005
Math. Methods Oper. Res., 2005
2004
SIAM J. Optim., 2004
A class of decomposition methods for convex optimization and monotone variational inclusions via the hybrid inexact proximal point framework.
Optim. Methods Softw., 2004
Optim. Methods Softw., 2004
Math. Oper. Res., 2004
2003
Convergence rate analysis of iteractive algorithms for solving variational inequality problems.
Math. Program., 2003
KarushKuhnTucker systems: regularity conditions, error bounds and a class of Newtontype 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
A new proximalbased globalization strategy for the JosephyNewton method for variational inequalities.
Optim. Methods Softw., 2002
The Theory of 2Regularity for Mappings with Lipschitzian Deriatives and its Applications to Optimality Conditions.
Math. Oper. Res., 2002
Comput. Optim. Appl., 2002
Proceedings of the 41st IEEE Conference on Decision and Control, 2002
2001
Error bounds for 2regular mappings with Lipschitzian derivatives and their applications.
Math. Program., 2001
2000
A Truly Globally Convergent NewtonType Method for the Monotone Nonlinear Complementarity Problem.
SIAM J. Optim., 2000
Error bounds for proximal point subproblems and associated inexact proximal point algorithms.
Math. Program., 2000
Math. Program., 2000
An Inexact Hybrid Generalized Proximal Point Algorithm and Some New Results on the Theory of Bregman Functions.
Math. Oper. Res., 2000
Some Methods Based on the DGap Function for Solving Monotone Variational Inequalities.
Comput. Optim. Appl., 2000
1999
Comput. Optim. Appl., 1999
A Linearly Convergent DerivativeFree Descent Method for Strongly Monotone Complementarity Problems.
Comput. Optim. Appl., 1999
Proceedings of the EuroPar '99 Parallel Processing, 5th International EuroPar Conference, Toulouse, France, August 31, 1999
1998
SIAM J. Optim., 1998
On the projected subgradient method for nonsmooth convex optimization in a Hilbert space.
Math. Program., 1998
Comput. Optim. Appl., 1998
1997
Comput. Optim. Appl., 1997
1994
Math. Oper. Res., 1994
1993
Math. Program., 1993
Proceedings of the Advances in Neural Information Processing Systems 6, 1993