Takayuki Okuno

Orcid: 0000-0003-2178-1494

According to our database1, Takayuki Okuno authored at least 15 papers between 2012 and 2024.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
Local convergence of primal-dual interior point methods for nonlinear semidefinite optimization using the Monteiro-Tsuchiya family of search directions.
Comput. Optim. Appl., June, 2024

Stable Linear System Identification With Prior Knowledge by Riemannian Sequential Quadratic Optimization.
IEEE Trans. Autom. Control., March, 2024

2023
Complexity analysis of interior-point methods for second-order stationary points of nonlinear semidefinite optimization problems.
Comput. Optim. Appl., November, 2023

Primal-dual path following method for nonlinear semi-infinite programs with semi-definite constraints.
Math. Program., May, 2023

Majorization-minimization-based Levenberg-Marquardt method for constrained nonlinear least squares.
Comput. Optim. Appl., April, 2023

A limiting analysis on regularization of singular SDP and its implication to infeasible interior-point algorithms.
Math. Program., 2023

2022
Sequential Quadratic Optimization for Nonlinear Optimization Problems on Riemannian Manifolds.
SIAM J. Optim., 2022

A stabilized sequential quadratic semidefinite programming method for degenerate nonlinear semidefinite programs.
Comput. Optim. Appl., 2022

2021
Extension of the LP-Newton method to conic programming problems via semi-infinite representation.
Numer. Algorithms, 2021

On lp-hyperparameter Learning via Bilevel Nonsmooth Optimization.
J. Mach. Learn. Res., 2021

2020
An interior point sequential quadratic programming-type method for log-determinant semi-infinite programs.
J. Comput. Appl. Math., 2020

2016
An exchange method with refined subproblems for convex semi-infinite programming problems.
Optim. Methods Softw., 2016

Simplex-type algorithm for second-order cone programmes via semi-infinite programming reformulation.
Optim. Methods Softw., 2016

2014
Local reduction based SQP-type method for semi-infinite programs with an infinite number of second-order cone constraints.
J. Glob. Optim., 2014

2012
A Regularized Explicit Exchange Method for Semi-Infinite Programs with an Infinite Number of Conic Constraints.
SIAM J. Optim., 2012


  Loading...