The following pages link to Akiko Takeda (Q208982):
Displaying 36 items.
- Generalized Subdifferentials of Spectral Functions over Euclidean Jordan Algebras (Q5148401) (← links)
- A Unified Classification Model Based on Robust Optimization (Q5327189) (← links)
- (Q5361279) (← links)
- DC Algorithm for Extended Robust Support Vector Machine (Q5380706) (← links)
- Extended Robust Support Vector Machine Based on Financial Risk Minimization (Q5383801) (← links)
- (Q5462189) (← links)
- Exact Semidefinite Programming Relaxations with Truncated Moment Matrix for Binary Polynomial Optimization Problems (Q5737720) (← links)
- On measuring the inefficiency with the inner-product norm in data envelopment analysis (Q5946151) (← links)
- Doubly majorized algorithm for sparsity-inducing optimization problems with regularizer-compatible constraints (Q6051303) (← links)
- Complexity analysis of interior-point methods for second-order stationary points of nonlinear semidefinite optimization problems (Q6051305) (← links)
- A study on modularity density maximization: column generation acceleration and computational complexity analysis (Q6112587) (← links)
- Stochastic Proximal Methods for Non-Smooth Non-Convex Constrained Sparse Optimization (Q6319309) (← links)
- Perturbed Iterate SGD for Lipschitz Continuous Loss Functions (Q6336888) (← links)
- Random projection of Linear and Semidefinite problem with linear inequalities (Q6344163) (← links)
- Approximate Bregman Proximal Gradient Algorithm for Relatively Smooth Nonconvex Optimization (Q6459260) (← links)
- Accelerated-gradient-based generalized Levenberg--Marquardt method with oracle complexity bound and local quadratic convergence (Q6505801) (← links)
- Randomized subspace regularized Newton method for unconstrained non-convex optimization (Q6506555) (← links)
- Parameter-free accelerated gradient descent for nonconvex minimization (Q6507288) (← links)
- "Universal heavy-ball method for nonconvex optimization under H\""older continuous Hessians" (Q6509016) (← links)
- Stochastic Approach for Price Optimization Problems with Decision-dependent Uncertainty (Q6510873) (← links)
- Zeroth-order Random Subspace Algorithm for Non-smooth Convex Optimization (Q6518840) (← links)
- Theoretical smoothing frameworks for general nonsmooth bilevel problems (Q6519711) (← links)
- Prediction-Correction Algorithm for Time-Varying Smooth Non-Convex Optimization (Q6521038) (← links)
- Parameter-free accelerated gradient descent for nonconvex minimization (Q6561381) (← links)
- Stable linear system identification with prior knowledge by Riemannian sequential quadratic optimization (Q6575915) (← links)
- Approximate Bregman proximal gradient algorithm for relatively smooth nonconvex optimization (Q6667696) (← links)
- Convergence error analysis of reflected gradient Langevin dynamics for non-convex constrained optimization (Q6671887) (← links)
- Subspace Quasi-Newton Method with Gradient Approximation (Q6731260) (← links)
- Primitive Heavy-ball Dynamics Achieves $O(\varepsilon^{-7/4})$ Convergence for Nonconvex Optimization (Q6731966) (← links)
- Sparse Sub-gaussian Random Projections for Semidefinite Programming Relaxations (Q6733355) (← links)
- Fast Convergence to Second-Order Stationary Point through Random Subspace Optimization (Q6733374) (← links)
- A four-operator splitting algorithm for nonconvex and nonsmooth optimization (Q6733696) (← links)
- Projection onto hyperbolicity cones and beyond: a dual Frank-Wolfe approach (Q6736291) (← links)
- Break recovery in graphical networks with D-trace loss (Q6747446) (← links)
- Univariate representations of solutions to generic polynomial complementarity problems (Q6750912) (← links)
- Douglas-Rachford algorithm for nonmonotone multioperator inclusion problems (Q6761096) (← links)
