Takayuki Okuno

Generating author description...

All published works

Action	Title	Year	Authors
+	Closing duality gaps of SDPs completely through perturbation when singularity degree is one	2024	Takashi Tsuchiya Bruno F. Lourenço Masakazu Muramatsu Takayuki Okuno
+	Closing Duality Gaps of SDPs through Perturbation	2023	Takashi Tsuchiya Bruno F. Lourenço Masakazu Muramatsu Takayuki Okuno
+	Accelerated-gradient-based generalized Levenberg--Marquardt method with oracle complexity bound and local quadratic convergence	2022	Naoki Marumo Takayuki Okuno Akiko Takeda
+	Analysis of the primal-dual central path for nonlinear semidefinite optimization without the nondegeneracy condition	2022	Takayuki Okuno
+	Stable Linear System Identification with Prior Knowledge by Riemannian Sequential Quadratic Optimization	2021	Mitsuaki Obara Kazuhiro Sato Takayuki Okuno Akiko Takeda
+	Majorization-Minimization-Based Levenberg--Marquardt Method for Constrained Nonlinear Least Squares	2020	Naoki Marumo Takayuki Okuno Akiko Takeda
+	Sequential Quadratic Optimization for Nonlinear Optimization Problems on Riemannian Manifolds	2020	Mitsuaki Obara Takayuki Okuno Akiko Takeda
+	A stabilized sequential quadratic semidefinite programming method for degenerate nonlinear semidefinite programs	2019	Yuya Yamakawa Takayuki Okuno
+	A Limiting Analysis on Regularization of Singular SDP and its Implication to Infeasible Interior-point Algorithms	2019	Takashi Tsuchiya Bruno F. Lourenço Masakazu Muramatsu Takayuki Okuno
+	Primal-dual path following method for nonlinear semi-infinite programs with semi-definite constraints	2018	Takayuki Okuno Masao Fukushima

Common Coauthors

Coauthor	Papers Together
Takashi Tsuchiya	3
Bruno F. Lourenço	3
Akiko Takeda	3
Masakazu Muramatsu	3
Mitsuaki Obara	2
Naoki Marumo	2
Masao Fukushima	1
Kazuhiro Sato	1
Akiko Takeda	1
Yuya Yamakawa	1

Commonly Cited References

Action	Title	Year	Authors	# of times referenced
+	On the Rate of Convergence of the Levenberg-Marquardt Method	2001	N. Yamashita Masao Fukushima	1
+	Trust Region Methods	2000	Andrew R. Conn Nicholas I. M. Gould Philippe L. Toint	1
+ PDF Chat	Strong local convergence properties of adaptive regularized methods for nonlinear least squares	2014	Stefania Bellavia Benedetta Morini	1
+	Accelerating the modified Levenberg-Marquardt method for nonlinear equations	2013	Jinyan Fan	1
+ PDF Chat	Mcplib: a collection of nonlinear mixed complementarity problems	1995	Steven P. Dirkse Michael C. Ferris	1
+	An adaptive accelerated proximal gradient method and its homotopy continuation for sparse optimization	2014	Qihang Lin Lin Xiao	1
+	A Superlinearly Convergent Primal-Dual Infeasible-Interior-Point Algorithm for Semidefinite Programming	1998	Florian A. Potra Rongqin Sheng	1
+	Adaptive cubic regularisation methods for unconstrained optimization. Part II: worst-case function- and derivative-evaluation complexity	2010	Coralia Cartis Nicholas I. M. Gould Philippe L. Toint	1
+	Inexact Levenberg-Marquardt method for nonlinear equations	2004	Jinyan Fan Jianyu Pan	1
+ PDF Chat	Convergence of a Regularized Euclidean Residual Algorithm for Nonlinear Least-Squares	2010	Stefania Bellavia Coralia Cartis Nicholas I. M. Gould Benedetta Morini Philippe L. Toint	1
+	Convergence Properties of a Self-adaptive Levenberg-Marquardt Algorithm Under Local Error Bound Condition	2005	Jinyan Fan Jianyu Pan	1
+ PDF Chat	On the Evaluation Complexity of Composite Function Minimization with Applications to Nonconvex Nonlinear Programming	2011	Coralia Cartis Nicholas I. M. Gould Philippe L. Toint	1
+ PDF Chat	A Subspace, Interior, and Conjugate Gradient Method for Large-Scale Bound-Constrained Minimization Problems	1999	Mary Ann Branch Thomas F. Coleman Yuying Li	1
+	Cubic regularization of Newton method and its global performance	2006	Yurii Nesterov B. T. Polyak	1
+	Convergence Rate of The Trust Region Method for Nonlinear Equations Under Local Error Bound Condition	2006	Jinyan Fan	1
+	Sparse Signal Recovery from Quadratic Measurements via Convex Programming	2012	Xiaodong Li Vladislav Voroninski	1
+	Gradient methods for minimizing composite functions	2012	Yu. Nesterov	1
+ PDF Chat	Cones of diagonally dominant matrices	1975	George P. Barker David Carlson	1
+	Error Bounds for Linear Matrix Inequalities	2000	J.F. Sturm	1
+	An improved trust region algorithm for nonlinear equations	2009	Jinyan Fan Jianyu Pan	1
+	On the inexactness level of robust Levenberg–Marquardt methods	2008	Andreas Fischer Pradyumn Kumar Shukla M. Wang	1
+	An exact duality theory for semidefinite programming and its complexity implications	1997	Motakuri V. Ramana	1
+ PDF Chat	How to generate weakly infeasible semidefinite programs via Lasserre’s relaxations for polynomial optimization	2011	Hayato Waki	1
+	On the Quadratic Convergence of the Levenberg-Marquardt Method without Nonsingularity Assumption	2005	Jinyan Fan Ya-xiang Yuan	1
+	The Geometry of Semidefinite Programming	2000	Gábor Pataki	1
+	Facial Reduction Algorithms for Conic Optimization Problems	2012	Hayato Waki Masakazu Muramatsu	1
+ PDF Chat	The modified Levenberg-Marquardt method for nonlinear equations with cubic convergence	2011	Jinyan Fan	1
+	Rank-Deficient Nonlinear Least Squares Problems and Subset Selection	2011	Ilse C. F. Ipsen C. T. Kelley Scott Russell Pope	1
+	A new trust region method for nonlinear equations	2003	Juliang Zhang Yong Wang	1
+	A family of Newton methods for nonsmooth constrained systems with nonisolated solutions	2012	Francisco Facchinei Andreas Fischer Markus Herrich	1
+	On the modified trust region algorithm for nonlinear equations	2014	Jinyan Fan Na Lu	1
+	Strong Duality for Semidefinite Programming	1997	Motakuri V. Ramana Levent Tunçel Henry Wolkowicz	1
+ PDF Chat	Facial reduction for a cone-convex programming problem	1981	Jonathan M. Borwein Henry Wolkowicz	1
+	On a Global Complexity Bound of the Levenberg-Marquardt Method	2010	Kenji Uéda Nobuo Yamashita	1
+	Erratum to “Levenberg–Marquardt methods with strong local convergence properties for solving nonlinear equations with convex constraints”	2005	Christian Kanzow Nobuo Yamashita Masao Fukushima	1
+ PDF Chat	Adaptive Restart for Accelerated Gradient Schemes	2013	Brendan O’Donoghue Emmanuel J. Candès	1
+ PDF Chat	An adaptive cubic regularization algorithm for nonconvex optimization with convex constraints and its function-evaluation complexity	2012	Coralia Cartis Nicholas I. M. Gould Philippe L. Toint	1
+	Iteration-complexity of first-order penalty methods for convex programming	2012	Guanghui Lan Renato D. C. Monteiro	1
+ PDF Chat	Adaptive cubic regularisation methods for unconstrained optimization. Part I: motivation, convergence and numerical results	2009	Coralia Cartis Nicholas I. M. Gould Philippe L. Toint	1
+	A unified local convergence analysis of inexact constrained Levenberg–Marquardt methods	2011	Roger Behling Andreas Fischer	1
+	Convergence Properties of the Inexact Levenberg-Marquardt Method under Local Error Bound Conditions	2002	Hiroshige Dan Nobuo Yamashita Masao Fukushima	1
+ PDF Chat	Nonlinear least squares — the Levenberg algorithm revisited	1976	M. R. Osborne	1
+ PDF Chat	Strong Duality in Conic Linear Programming: Facial Reduction and Extended Duals	2013	Gábor Pataki	1
+	A method for the solution of certain non-linear problems in least squares	1944	Kenneth Levenberg	1
+	On the convergence rate of the inexact Levenberg-Marquardt method	2011	Jinyan Fan Jianyu Pan	1
+ PDF Chat	On the Levenberg-Marquardt methods for convex constrained nonlinear equations	2012	Jinyan Fan	1
+	Global complexity bound of the Levenberg–Marquardt method	2016	Ruixue Zhao Jinyan Fan	1
+ PDF Chat	Handbook of Semidefinite Programming	2000	Henry Wolkowicz Romesh Saigal Lieven Vandenberghe	1
+ PDF Chat	Solving Conic Optimization Problems via Self-Dual Embedding and Facial Reduction: A Unified Approach	2017	Frank Permenter Henrik A. Friberg Erling D. Andersen	1
+ PDF Chat	A Levenberg–Marquardt method for large nonlinear least-squares problems with dynamic accuracy in functions and gradients	2018	Stefania Bellavia Serge Gratton Elisa Riccietti	1