Cover Image

Inexact subgradient algorithm with a non-asymptotic convergence guarantee for copositive programming problems

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Nishijima, Mitsuhiro, Poirion, Pierre-Louis, Takeda, Akiko
Format:	Preprint
Published:	2025
Subjects:	Optimization and Control
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Theoretical analysis of the randomized subspace regularized Newton method for non-convex optimization
by: Fuji, Terunari, et al.
Published: (2022)

Random-Subspace Frank--Wolfe over Strongly Convex Sets
by: Poirion, Pierre-Louis, et al.
Published: (2026)

Facial structure of copositive and completely positive cones over a second-order cone
by: Nishijima, Mitsuhiro, et al.
Published: (2025)

Efficient Optimization with Orthogonality Constraint: a Randomized Riemannian Submanifold Method
by: Han, Andi, et al.
Published: (2025)

On the longest chain of faces of the completely positive and copositive cones
by: Nishijima, Mitsuhiro
Published: (2023)

Subspace Quasi-Newton Method with Gradient Approximation
by: Miyaishi, Taisei, et al.
Published: (2024)

Sparse Sub-gaussian Random Projections for Semidefinite Programming Relaxations
by: Guedes-Ayala, Monse, et al.
Published: (2024)

Non-facial exposedness of copositive cones over symmetric cones
by: Nishijima, Mitsuhiro, et al.
Published: (2024)

Improving Convergence Guarantees of Random Subspace Second-order Algorithm for Nonconvex Optimization
by: Higuchi, Rei, et al.
Published: (2024)

Convergence Analysis of Randomized Subspace Normalized SGD under Heavy-Tailed Noise
by: Omiya, Gaku, et al.
Published: (2026)

Inexact subgradient methods for semialgebraic functions
by: Bolte, Jérôme, et al.
Published: (2024)

Fairness in Robust Unit Commitment Problem Considering Suppression of Renewable Energy
by: Toyoshima, Ichiro, et al.
Published: (2026)

Randomized Subspace Nesterov Accelerated Gradient
by: Omiya, Gaku, et al.
Published: (2026)

Zeroth-order Random Subspace Algorithm for Non-smooth Convex Optimization
by: Nozawa, Ryota, et al.
Published: (2024)

Random minibatch subgradient algorithms for convex problems with functional constraints
by: Nedich, Angelia, et al.
Published: (2019)

An Inexact Variable Metric Proximal Gradient-subgradient Algorithm for a Class of Fractional Optimization Problems
by: Yang, Lei, et al.
Published: (2025)

Local near-quadratic convergence of Riemannian interior point methods
by: Obara, Mitsuaki, et al.
Published: (2025)

Convergence guarantees for stochastic algorithms solving non-unique problems in metric spaces
by: Pischke, Nicholas, et al.
Published: (2026)

Theoretical smoothing frameworks for nonsmooth simple bilevel problems
by: Alcantara, Jan Harold, et al.
Published: (2024)

Douglas--Rachford algorithm for nonmonotone multioperator inclusion problems
by: Alcantara, Jan Harold, et al.
Published: (2025)

Approximate Bregman proximal gradient algorithm with variable metric Armijo--Wolfe line search
by: Fujiki, Kiwamu, et al.
Published: (2025)

On convergence rates of subgradient descent on semialgebraic functions
by: Chzhen, Evgenii, et al.
Published: (2026)

Learning to optimize with guarantees: a complete characterization of linearly convergent algorithms
by: Martin, Andrea, et al.
Published: (2025)

A finite-termination algorithm for testing copositivity over the positive semidefinite cone
by: Huang, Lei, et al.
Published: (2026)

Complexity and convergence analysis of a single-loop SDCAM for Lipschitz composite optimization and beyond
by: Zhang, Hao, et al.
Published: (2025)

A proximal subgradient algorithm for constrained multiobjective DC-type optimization
by: Van Tuyen, Nguyen, et al.
Published: (2025)

On the (linear) convergence of Generalized Newton Inexact ADMM
by: Frangella, Zachary, et al.
Published: (2023)

A primal-dual interior point trust region method for second-order stationary points of Riemannian inequality-constrained optimization problems
by: Obara, Mitsuaki, et al.
Published: (2025)

An effective subgradient algorithm via Mifflin's line search for nonsmooth nonconvex multiobjective optimization
by: Maleknia, Morteza, et al.
Published: (2024)

A nonmonotone extrapolated proximal gradient-subgradient algorithm beyond global Lipschitz gradient continuity
by: Yang, Lei, et al.
Published: (2025)

Global non-asymptotic super-linear convergence rates of regularized proximal quasi-Newton methods on non-smooth composite problems
by: Wang, Shida, et al.
Published: (2024)

Finding quadratic underestimators for optimal value functions of nonconvex all-quadratic problems via copositive optimization
by: Gabl, Markus, et al.
Published: (2024)

Some iterative algorithms on Riemannian manifolds and Banach spaces with good global convergence guarantee
by: Truong, Tuyen Trung
Published: (2025)

Practical Regularized Quasi-Newton Methods with Inexact Function Values
by: Hamaguchi, Hiroki, et al.
Published: (2026)

Inexact JKO and proximal-gradient algorithms in the Wasserstein space
by: Di Marino, Simone, et al.
Published: (2025)

Computing local minimizers in polynomial optimization under genericity conditions
by: Hieu, Vu Trung, et al.
Published: (2023)

The maximal angle between $3 \times 3$ copositive matrices
by: Gourion, Daniel
Published: (2025)

Higher Degree Inexact Model for Optimization problems
by: Alkousa, Mohammad, et al.
Published: (2024)

Univariate representations of solutions to generic polynomial complementarity problems
by: Hieu, Vu Trung, et al.
Published: (2024)

Stochastic subgradient for composite optimization with functional constraints
by: Necoara, Ion, et al.
Published: (2022)