Nobuo Yamashita
According to our database1,
Nobuo Yamashita
authored at least 33 papers
between 1996 and 2024.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
On csauthors.net:
Bibliography
2024
Convergence properties of Levenberg-Marquardt methods with generalized regularization terms.
Appl. Math. Comput., February, 2024
2023
An equivalent nonlinear optimization model with triangular low-rank factorization for semidefinite programs.
Optim. Methods Softw., November, 2023
Comput. Optim. Appl., November, 2023
Distributionally robust expected residual minimization for stochastic variational inequality problems.
Optim. Methods Softw., July, 2023
Optim. Lett., March, 2023
Convergence analysis and acceleration of the smoothing methods for solving extensive-form games.
CoRR, 2023
2022
A Stochastic Variance Reduced Gradient using Barzilai-Borwein Techniques as Second Order Information.
CoRR, 2022
A globally convergent fast iterative shrinkage-thresholding algorithm with a new momentum factor for single and multi-objective convex optimization.
CoRR, 2022
A regularized limited memory BFGS method for large-scale unconstrained optimization and its efficient implementations.
Comput. Optim. Appl., 2022
2021
An alternating direction method of multipliers with the BFGS update for structured convex quadratic optimization.
Comput. Appl. Math., 2021
2019
Augmented Lagrangian Method with Alternating Constraints for Nonlinear Optimization Problems.
J. Optim. Theory Appl., 2019
J. Glob. Optim., 2019
Comput. Optim. Appl., 2019
2018
Comput. Optim. Appl., 2018
2017
Erratum to: A regularized Newton method without line search for unconstrained optimization.
Comput. Optim. Appl., 2017
2016
An exchange method with refined subproblems for convex semi-infinite programming problems.
Optim. Methods Softw., 2016
Block coordinate proximal gradient methods with variable Bregman functions for nonsmooth separable optimization.
Math. Program., 2016
2015
Iteration Complexity of a Block Coordinate Gradient Descent Method for Convex Optimization.
SIAM J. Optim., 2015
2014
Comput. Optim. Appl., 2014
2012
Global Complexity Bound Analysis of the Levenberg-Marquardt Method for Nonsmooth Equations and Its Application to the Nonlinear Complementarity Problem.
J. Optim. Theory Appl., 2012
2010
J. Optim. Theory Appl., 2010
2008
Math. Program., 2008
2005
A Combined Smoothing and Regularization Method for Monotone Second-Order Cone Complementarity Problems.
SIAM J. Optim., 2005
2004
A nonlinear complementarity approach to multiuser power control for digital subscriber lines.
Optim. Methods Softw., 2004
On the identification of degenerate indices in the nonlinear complementarity problem with the proximal point algorithm.
Math. Program., 2004
Comput. Optim. Appl., 2004
2003
Comput. Optim. Appl., 2003
2002
Convergence Properties of the Inexact Levenberg-Marquardt Method under Local Error Bound Conditions.
Optim. Methods Softw., 2002
A Superlinearly Convergent Algorithm for the Monotone Nonlinear Complementarity Problem Without Uniqueness and Nondegeneracy Conditions.
Math. Oper. Res., 2002
2000
The Proximal Point Algorithm with Genuine Superlinear Convergence for the Monotone Complementarity Problem.
SIAM J. Optim., 2000
1996
Equivalence of Complementarity Problems to Differentiable Minimization: A Unified Approach.
SIAM J. Optim., 1996
Modified Newton methods for solving a semismooth reformulation of monotone complementarity problems.
Math. Program., 1996