:: Library Catalog

Imagen de Portada

Guardado en:

Detalles Bibliográficos
Autores principales:	Hu, Yukuan, Li, Mengyu, Liu, Xin, Meng, Cheng
Formato:	Preprint
Publicado:	2023
Materias:	Optimization and Control Chemical Physics Computational Physics 52-08, 65C05, 65F50, 81V05, 90C30
Acceso en línea:	https://arxiv.org/abs/2306.16763
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

Normalized tensor train decomposition
por: Peng, Renfeng, et al.
Publicado: (2025)

A preconditioned inexact infeasible quantum interior point method for linear optimization
por: Wu, Zeguan, et al.
Publicado: (2024)

Riemannian Trust Region Methods for SC$^1$ Minimization
por: Zhang, Chenyu, et al.
Publicado: (2023)

A Massively Parallel Interior-Point Method for Arrowhead Linear Programs with Local Linking Structure
por: Kempke, Nils-Christian, et al.
Publicado: (2024)

Inexact Riemannian Gradient Descent Method for Nonconvex Optimization
por: Zhou, Juan, et al.
Publicado: (2024)

Shadow splitting methods for nonconvex optimisation: epi-approximation, convergence and saddle point avoidance
por: Atenas, Felipe
Publicado: (2025)

Understanding the Douglas-Rachford splitting method through the lenses of Moreau-type envelopes
por: Atenas, Felipe
Publicado: (2023)

On the Regularity and Interpolation of Coupled Cluster Amplitudes in Canonical Orbital Basis
por: Beck, Jonas, et al.
Publicado: (2026)

Symplectic Extra-gradient Type Method for Solving General Non-monotone Inclusion Problem
por: Yuan, Ya-xiang, et al.
Publicado: (2024)

A new problem qualification based on approximate KKT conditions for Lipschitzian optimization with application to bilevel programming
por: Käming, Isabella, et al.
Publicado: (2024)

ASPEN: An Additional Sampling Penalty Method for Finite-Sum Optimization Problems with Nonlinear Equality Constraints
por: Krejić, Nataša, et al.
Publicado: (2025)

Improved Penalty Function Approaches for Optimization Problems with General Orthogonality
por: Zhang, Yongshen, et al.
Publicado: (2026)

An interior proximal gradient method for nonconvex optimization
por: De Marchi, Alberto, et al.
Publicado: (2022)

Distributed accelerated proximal conjugate gradient methods for multi-agent constrained optimization problems
por: Gebrie, Anteneh Getachew
Publicado: (2023)

Stochastic Approach for Price Optimization Problems with Decision-dependent Uncertainty
por: Hikima, Yuya, et al.
Publicado: (2023)

Parameter-Free Accelerated Quasi-Newton Method for Nonconvex Optimization
por: Marumo, Naoki
Publicado: (2025)

Optimization in complex spaces with the Mixed Newton Method
por: Bakhurin, Sergey, et al.
Publicado: (2022)

Accelerated Gradient Methods with Gradient Restart: Global Linear Convergence
por: Bao, Chenglong, et al.
Publicado: (2024)

Proximal Gradient Descent Ascent Methods for Nonsmooth Nonconvex-Concave Minimax Problems on Riemannian Manifolds
por: Xie, Xiyuan, et al.
Publicado: (2025)

Time-integrated Optimal Transport: A Robust Minimax Framework
por: Nguyen, Thai P. D., et al.
Publicado: (2025)

MGProx: A nonsmooth multigrid proximal gradient method with adaptive restriction for strongly convex optimization
por: Ang, Andersen, et al.
Publicado: (2023)

The Global R-linear Convergence of Nesterov's Accelerated Gradient Method with Unknown Strongly Convex Parameter
por: Bao, Chenglong, et al.
Publicado: (2023)

Stochastic optimization over proximally smooth sets
por: Davis, Damek, et al.
Publicado: (2020)

BUP-TR: Bayesian Underdetermined Projection Trust-Region Methods for Derivative-Free Optimization
por: Hu, Wei, et al.
Publicado: (2026)

Nonlinear Derivative-free Constrained Optimization with a Penalty-Interior Point Method and Direct Search
por: Brilli, Andrea, et al.
Publicado: (2024)

A relaxed version of Ryu's three-operator splitting method for structured nonconvex optimization
por: Alcantara, Jan Harold, et al.
Publicado: (2025)

AS-BOX: Additional Sampling Method for Weighted Sum Problems with Box Constraints
por: Krejić, Nataša, et al.
Publicado: (2025)

Fast Optimistic Gradient Descent Ascent (OGDA) method in continuous and discrete time
por: Bot, Radu Ioan, et al.
Publicado: (2022)

Proximal methods for structured nonsmooth optimization over Riemannian submanifolds
por: Li, Qia, et al.
Publicado: (2024)

The Augmented Lagrangian Methods: Overview and Recent Advances
por: Deng, Kangkang, et al.
Publicado: (2025)

A Stochastic Implicit Proximal Point Algorithm for Solving Linearly Constrained Stochastic Minimax Problems
por: Zhu, Kehan, et al.
Publicado: (2026)

Algebraic Multigrid with Filtering: An Efficient Preconditioner for Interior Point Methods in Large-Scale Contact Mechanics Optimization
por: Petrides, Socratis, et al.
Publicado: (2025)

Nonmonotone subgradient methods based on a local descent lemma
por: Aragón-Artacho, Francisco J., et al.
Publicado: (2025)

Preconditioned Proximal Gradient Methods with Conjugate Momentum: A Subspace Perspective
por: Chen, Jian, et al.
Publicado: (2026)

A New Two-dimensional Model-based Subspace Method for Large-scale Unconstrained Derivative-free Optimization: 2D-MoSub
por: Xie, Pengcheng, et al.
Publicado: (2023)

Local Convergence Analysis of ADMM for Nonconvex Composite Optimization
por: Xie, Xiyuan, et al.
Publicado: (2026)

Convergence-Guaranteed Algorithms for l1/2-Regularized Quadratic Programs with Assignment Constraints
por: Xie, Lijun, et al.
Publicado: (2025)

Stochastic momentum ADMM for nonconvex and nonsmooth optimization with application to PnP algorithm
por: Deng, Kangkang, et al.
Publicado: (2025)

A penalty barrier framework for nonconvex constrained optimization
por: De Marchi, Alberto, et al.
Publicado: (2024)

First-order majorization-minimization meets high-order majorant: Boosted inexact high-order forward-backward method
por: Kabgani, Alireza, et al.
Publicado: (2025)