Imagen de Portada

An accelerated proximal PRS-SQP algorithm with dual ascent-descent procedures for smooth composite optimization

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Jin, Jiachen, Ma, Guodong, Jian, Jinbao
Formato:	Preprint
Publicado:	2025
Materias:	Optimization and Control
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

An accelerated first-order regularized momentum descent ascent algorithm for stochastic nonconvex-concave minimax problems
por: Zhang, Huiling, et al.
Publicado: (2023)

An accelerated proximal bundle method for convex optimization
por: Liao, Feng-Yi, et al.
Publicado: (2025)

A descent method for nonsmooth multiobjective optimization problems on Riemannian manifolds
por: Tang, Chunming, et al.
Publicado: (2023)

Variable smoothing algorithm for inner-loop-free DC composite optimizations
por: Yazawa, Kumataro, et al.
Publicado: (2025)

Decentralized non-convex optimization via bi-level SQP and ADMM
por: Stomberg, Gösta, et al.
Publicado: (2022)

Stochastic smoothing accelerated gradient method for general constrained nonsmooth convex composite optimization
por: Wang, Ruyu, et al.
Publicado: (2023)

Non-smooth stochastic gradient descent using smoothing functions
por: Giovannelli, Tommaso, et al.
Publicado: (2025)

Random coordinate descent methods for nonseparable composite optimization
por: Chorobura, Flavia, et al.
Publicado: (2022)

Projected proximal gradient trust-region algorithm for nonsmooth optimization
por: Dao, Minh N., et al.
Publicado: (2025)

Coordinate descent methods beyond smoothness and separability
por: Chorobura, Flavia, et al.
Publicado: (2024)

An accelerated semi-proximal ADMM with applications to multi-block sparse optimization problems
por: Liu, Peng, et al.
Publicado: (2025)

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

Stabilized SQP Methods in Hilbert Spaces
por: Uihlein, Andrian, et al.
Publicado: (2023)

Research on the descent direction of prediction correction algorithms for pseudo-convex/convex optimization problems
por: Li, Ting, et al.
Publicado: (2025)

Improved SQP and SLSQP Algorithms for Feasible Path-based Process Optimisation
por: Ma, Yingjie, et al.
Publicado: (2024)

A smoothing Anderson acceleration algorithm for nonsmooth fixed point problem with linear convergence
por: Li, Zekai, et al.
Publicado: (2024)

Inertial accelerated primal-dual algorithms for non-smooth convex optimization problems with linear equality constraints
por: Zhang, Huan, et al.
Publicado: (2025)

Active learning for anti-disturbance dual control of unknown nonlinear systems
por: Ma, Xuehui, et al.
Publicado: (2022)

A restricted memory quasi-Newton bundle method for nonsmooth optimization on Riemannian manifolds
por: Tang, Chunming, et al.
Publicado: (2024)

Anderson acceleration of derivative-free projection methods for constrained monotone nonlinear equations
por: Jin, Jiachen, et al.
Publicado: (2024)

Adaptive control mechanisms in gradient descent algorithms
por: Iannelli, Andrea
Publicado: (2025)

Extended SQP Methods in Nonsmooth Difference Programming Applied to Problems with Variational Inequality Constraints
por: Mordukhovich, Boris S., et al.
Publicado: (2025)

Anderson Acceleration for Linearly Converging SQP-Type Methods
por: Frey, Jonathan, et al.
Publicado: (2026)

An inexact variable metric proximal linearization method for composite optimization on manifolds
por: He, Hao, et al.
Publicado: (2025)

Efficiency of stochastic coordinate proximal gradient methods on nonseparable composite optimization
por: Necoara, I., et al.
Publicado: (2021)

Non-ergodic convergence rate of an inertial accelerated primal-dual algorithm for saddle point problems
por: He, X., et al.
Publicado: (2023)

Monotone and nonmonotone linearized block coordinate descent methods for nonsmooth composite optimization problems
por: Nabou, Yassine, et al.
Publicado: (2025)

Primal-dual algorithm for distributed optimization: A dissipativity-based perspective
por: Li, Weijian, et al.
Publicado: (2026)

Unifying restart accelerated gradient and proximal bundle methods
por: Liang, Jiaming
Publicado: (2025)

Self-concordant smoothing in proximal quasi-Newton algorithms for large-scale convex composite optimization
por: Adeoye, Adeyemi D., et al.
Publicado: (2023)

Proximal gradient descent on the smoothed duality gap to solve saddle point problems
por: Fercoq, Olivier
Publicado: (2025)

Linear convergence of proximal descent schemes on the Wasserstein space
por: Lascu, Razvan-Andrei, et al.
Publicado: (2024)

A Noise Tolerant SQP Algorithm for Inequality Constrained Optimization
por: Oztoprak, Figen, et al.
Publicado: (2026)

Stochastic dual coordinate descent with adaptive heavy ball momentum for linearly constrained convex optimization
por: Zeng, Yun, et al.
Publicado: (2023)

Oscillating solutions to the mean-field Langevin descent-ascent flow
por: Mourrat, Jean-Christophe, et al.
Publicado: (2026)

SSNCVX: A primal-dual semismooth Newton method for convex composite optimization problem
por: Deng, Zhanwang, et al.
Publicado: (2025)

An inexact Bregman proximal point method and its acceleration version for unbalanced optimal transport
por: Chen, Xiang, et al.
Publicado: (2024)

An inexact $q$-order regularized proximal Newton method for nonconvex composite optimization
por: Liu, Ruyu, et al.
Publicado: (2023)

PL conditions do not guarantee convergence of gradient descent-ascent dynamics
por: Mourrat, Jean-Christophe
Publicado: (2026)

Non-Euclidean dual gradient ascent for entropically regularized linear and semidefinite programming
por: Cai, Yuhang, et al.
Publicado: (2025)