M. V. Solodov - Citegraph

Author Info

Name	Affiliation	Papers
M. V. SOLODOV	IMPA, Instituto de Matemática Pura e Aplicada, Estrada Dona Castorina 110, Jardim Botânico, 22460-320, Rio de Janeiro, RJ, Brazil	35
Collaborators	Citations	PageRank
18	600	72.47
Referers	Referees	References
739	219	409

Search Limit

100739

Publications (35 rows)

Collaborators (18 rows)

Referers (100 rows)

Referees (100 rows)

Title	Citations	PageRank	Year
Perturbed Augmented Lagrangian Method Framework with Applications to Proximal and Smoothed Variants	0	0.34	2022
Unit Stepsize For The Newton Method Close To Critical Solutions	1	0.36	2021
Accelerating Convergence Of The Globalized Newton Method To Critical Solutions Of Nonlinear Equations	1	0.36	2021
A proximal bundle method for nonsmooth nonconvex functions with inexact information	17	0.60	2016
Convergence conditions for Newton-type methods applied to complementarity systems with nonisolated solutions	7	0.55	2016
Semismooth Newton method for the lifted reformulation of mathematical programs with complementarity constraints	11	0.65	2012
Stabilized SQP revisited	23	0.93	2012
On attraction of linearly constrained Lagrangian methods and of stabilized and quasi-Newton SQP methods to critical multipliers	16	0.79	2011
Semismooth SQP method for equality-constrained optimization problems with an application to the lifted reformulation of mathematical programs with complementarity constraints	1	0.37	2011
Inexact Josephy–Newton framework for generalized equations and its applications to local analysis of Newtonian methods for constrained optimization	12	0.86	2010
Sharp Primal Superlinear Convergence Results for Some Newtonian Methods for Constrained Optimization	7	0.55	2010
A Truncated SQP Method Based on Inexact Interior-Point Solutions of Subproblems	7	0.49	2010
Mathematical Programs with Vanishing Constraints: Optimality Conditions, Sensitivity, and a Relaxation Method	13	0.84	2009
On attraction of Newton-type iterates to multipliers violating second-order sufficiency conditions	18	0.98	2009
An Active-Set Newton Method for Mathematical Programs with Complementarity Constraints	10	0.67	2008
A Class of Inexact Variable Metric Proximal Point Algorithms	14	0.71	2008
On the Sequential Quadratically Constrained Quadratic Programming Methods	14	0.78	2004
A class of decomposition methods for convex optimization and monotone variational inclusions via the hybrid inexact proximal point framework	7	0.68	2004
Newton-Type Methods for Optimization Problems without Constraint Qualifications	13	0.97	2004
Parallel Variable Distribution for Constrained Optimization	17	0.88	2002
Complementarity Constraint Qualification via the Theory of 2-Regularity	4	0.69	2002
Optimality Conditions for Irregular Inequality-Constrained Problems	15	1.33	2002
Superlinearly Convergent Algorithms for Solving Singular Equations and Smooth Reformulations of Complementarity Problems	6	0.63	2002
A New Proximal-Based Globalization Strategy for the Josephy-Newton Method for Variational Inequalities	2	0.42	2002
The Theory of 2-Regularity for Mappings with Lipschitzian Derivatives and its Applications to Optimality Conditions	22	2.35	2002
Error bounds for 2-regular mappings with Lipschitzian derivatives and their applications	16	1.62	2001
Error bounds for proximal point subproblems and associated inexact proximal point algorithms	35	2.58	2000
An Inexact Hybrid Generalized Proximal Point Algorithm and Some New Results on the Theory of Bregman Functions	41	5.93	2000
Forcing strong convergence of proximal point iterations in a Hilbert space	39	10.29	2000
A Truly Globally Convergent Newton-Type Method for the Monotone Nonlinear Complementarity Problem	18	2.87	2000
A Linearly Convergent Derivative-Free Descent Method for Strongly Monotone Complementarity Problems	5	0.55	1999
On the projected subgradient method for nonsmooth convex optimization in a Hilbert space	51	4.31	1998
Incremental Gradient Algorithms with Stepsizes Bounded Away from Zero	44	6.95	1998
New Error Bounds for the Linear Complementarity Problem	17	5.71	1994
Nonlinear complementarity as unconstrained and constrained minimization	76	12.85	1993