Mikhail V. Solodov
According to our database^{1},
Mikhail V. Solodov
authored at least 73 papers
between 1993 and 2019.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis OtherLinks
Homepage:

at w3.impa.br
On csauthors.net:
Bibliography
2019
Multiplier Stabilization Applied to TwoStage Stochastic Programs.
J. Optimization Theory and Applications, 2019
Local Attractors of NewtonType Methods for Constrained Equations and Complementarity Problems with Nonisolated Solutions.
J. Optimization Theory and Applications, 2019
A globally convergent LevenbergMarquardt method for equalityconstrained optimization.
Comp. Opt. and Appl., 2019
2018
Critical solutions of nonlinear equations: stability issues.
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.
Comp. Opt. and Appl., 2018
2016
A Globally Convergent LPNewton Method.
SIAM Journal on Optimization, 2016
Some new facts about sequential quadratic programming methods employing second derivatives.
Optimization Methods and Software, 2016
A doubly stabilized bundle method for nonsmooth convex optimization.
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. Optimization Theory and Applications, 2016
A proximal bundle method for nonsmooth nonconvex functions with inexact information.
Comp. Opt. and Appl., 2016
Convergence conditions for Newtontype methods applied to complementarity systems with nonisolated solutions.
Comp. Opt. and Appl., 2016
2015
Some compositestep constrained optimization methods interpreted via the perturbed sequential quadratic programming framework.
Optimization Methods and Software, 2015
NewtonType Methods: A Broader View.
J. Optimization Theory and Applications, 2015
Combining stabilized SQP with the augmented Lagrangian algorithm.
Comp. Opt. and Appl., 2015
Local convergence of the method of multipliers for variational and optimization problems under the noncriticality assumption.
Comp. Opt. and 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.
Comp. Opt. and 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 Journal on Optimization, 2012
Local Convergence of Exact and Inexact Augmented Lagrangian Methods under the SecondOrder Sufficient Optimality Condition.
SIAM Journal on Optimization, 2012
Stabilized SQP revisited.
Math. Program., 2012
Semismooth Newton method for the lifted reformulation of mathematical programs with complementarity constraints.
Comp. Opt. and Appl., 2012
Solving generation expansion planning problems with environmental constraints by a bundle method.
Comput. Manag. Science, 2012
2011
Semismooth SQP method for equalityconstrained optimization problems with an application to the lifted reformulation of mathematical programs with complementarity constraints.
Optimization Methods and Software, 2011
On attraction of linearly constrained Lagrangian methods and of stabilized and quasiNewton SQP methods to critical multipliers.
Math. Program., 2011
2010
A Truncated SQP Method Based on Inexact InteriorPoint Solutions of Subproblems.
SIAM Journal on Optimization, 2010
Sharp Primal Superlinear Convergence Results for Some Newtonian Methods for Constrained Optimization.
SIAM Journal on Optimization, 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.
Comp. Opt. and Appl., 2010
2009
Implicit Lagrangian.
Proceedings of the Encyclopedia of Optimization, Second Edition, 2009
Identifying Structure of Nonsmooth Convex Functions by the Bundle Technique.
SIAM Journal on Optimization, 2009
Global convergence of an SQP method without boundedness assumptions on any of the iterative sequences.
Math. Program., 2009
A bundlefilter method for nonsmooth convex constrained optimization.
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.
Comp. Opt. and Appl., 2009
2008
A Class of Inexact Variable Metric Proximal Point Algorithms.
SIAM Journal on Optimization, 2008
An ActiveSet Newton Method for Mathematical Programs with Complementarity Constraints.
SIAM Journal on Optimization, 2008
On local convergence of sequential quadraticallyconstrained quadraticprogramming type methods, with an extension to variational problems.
Comp. Opt. and Appl., 2008
2007
A Bundle Method for a Class of Bilevel Nonsmooth Convex Minimization Problems.
SIAM Journal on Optimization, 2007
2005
An Infeasible Bundle Method for Nonsmooth Convex Constrained Optimization without a Penalty Function or a Filter.
SIAM Journal on Optimization, 2005
A Class of ActiveSet Newton Methods for Mixed ComplementarityProblems.
SIAM Journal on Optimization, 2005
A note on solution sensitivity for KarushKuhnTucker systems.
Math. Meth. of OR, 2005
2004
NewtonType Methods for Optimization Problems without Constraint Qualifications.
SIAM Journal on Optimization, 2004
A class of decomposition methods for convex optimization and monotone variational inclusions via the hybrid inexact proximal point framework.
Optimization Methods and Software, 2004
Foreword: special issue for the 70th birthday of professor Olvi Mangasarian.
Optimization Methods and Software, 2004
On the Sequential Quadratically Constrained Quadratic Programming Methods.
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 Journal on Optimization, 2002
Complementarity Constraint Qualification via the Theory of 2Regularity.
SIAM Journal on Optimization, 2002
Optimality Conditions for Irregular InequalityConstrained Problems.
SIAM J. Control and Optimization, 2002
A new proximalbased globalization strategy for the JosephyNewton method for variational inequalities.
Optimization Methods and Software, 2002
The Theory of 2Regularity for Mappings with Lipschitzian Deriatives and its Applications to Optimality Conditions.
Math. Oper. Res., 2002
Parallel Variable Distribution for Constrained Optimization.
Comp. Opt. and Appl., 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 Journal on Optimization, 2000
Error bounds for proximal point subproblems and associated inexact proximal point algorithms.
Math. Program., 2000
Forcing strong convergence of proximal point iterations in a Hilbert space.
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.
Comp. Opt. and Appl., 2000
1999
Some Optimization Reformulations of the Extended Linear Complementarity Problem.
Comp. Opt. and Appl., 1999
A Linearly Convergent DerivativeFree Descent Method for Strongly Monotone Complementarity Problems.
Comp. Opt. and Appl., 1999
Parallel Constrained Optimization via Distribution of Variables.
Proceedings of the EuroPar '99 Parallel Processing, 5th International EuroPar Conference, Toulouse, France, August 31, 1999
1998
On the Convergence of Constrained Parallel Variable Distribution Algorithms.
SIAM Journal on Optimization, 1998
On the projected subgradient method for nonsmooth convex optimization in a Hilbert space.
Math. Program., 1998
Incremental Gradient Algorithms with Stepsizes Bounded Away from Zero.
Comp. Opt. and Appl., 1998
1997
New Inexact Parallel Variable Distribution Algorithms.
Comp. Opt. and Appl., 1997
1994
New Error Bounds for the Linear Complementarity Problem.
Math. Oper. Res., 1994
1993
Nonlinear complementarity as unconstrained and constrained minimization.
Math. Program., 1993
Backpropagation Convergence via Deterministic Nonmonotone Perturbed Minimization.
Proceedings of the Advances in Neural Information Processing Systems 6, 1993