Image de couverture de livre

Sampling-Based Methods for Multi-Block Optimization Problems over Transport Polytopes

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Hu, Yukuan, Li, Mengyu, Liu, Xin, Meng, Cheng
Format:	Preprint
Publié:	2023
Sujets:	Optimization and Control Chemical Physics Computational Physics 52-08, 65C05, 65F50, 81V05, 90C30
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

Normalized tensor train decomposition
par: Peng, Renfeng, et autres
Publié: (2025)

A preconditioned inexact infeasible quantum interior point method for linear optimization
par: Wu, Zeguan, et autres
Publié: (2024)

Inexact Riemannian Gradient Descent Method for Nonconvex Optimization
par: Zhou, Juan, et autres
Publié: (2024)

A Massively Parallel Interior-Point Method for Arrowhead Linear Programs with Local Linking Structure
par: Kempke, Nils-Christian, et autres
Publié: (2024)

Riemannian Trust Region Methods for SC$^1$ Minimization
par: Zhang, Chenyu, et autres
Publié: (2023)

Improved Penalty Function Approaches for Optimization Problems with General Orthogonality
par: Zhang, Yongshen, et autres
Publié: (2026)

ASPEN: An Additional Sampling Penalty Method for Finite-Sum Optimization Problems with Nonlinear Equality Constraints
par: Krejić, Nataša, et autres
Publié: (2025)

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

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

A new problem qualification based on approximate KKT conditions for Lipschitzian optimization with application to bilevel programming
par: Käming, Isabella, et autres
Publié: (2024)

An interior proximal gradient method for nonconvex optimization
par: De Marchi, Alberto, et autres
Publié: (2022)

Symplectic Extra-gradient Type Method for Solving General Non-monotone Inclusion Problem
par: Yuan, Ya-xiang, et autres
Publié: (2024)

Stochastic Approach for Price Optimization Problems with Decision-dependent Uncertainty
par: Hikima, Yuya, et autres
Publié: (2023)

On the Regularity and Interpolation of Coupled Cluster Amplitudes in Canonical Orbital Basis
par: Beck, Jonas, et autres
Publié: (2026)

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

Proximal Gradient Descent Ascent Methods for Nonsmooth Nonconvex-Concave Minimax Problems on Riemannian Manifolds
par: Xie, Xiyuan, et autres
Publié: (2025)

Parameter-Free Accelerated Quasi-Newton Method for Nonconvex Optimization
par: Marumo, Naoki
Publié: (2025)

BUP-TR: Bayesian Underdetermined Projection Trust-Region Methods for Derivative-Free Optimization
par: Hu, Wei, et autres
Publié: (2026)

Optimization in complex spaces with the Mixed Newton Method
par: Bakhurin, Sergey, et autres
Publié: (2022)

Time-integrated Optimal Transport: A Robust Minimax Framework
par: Nguyen, Thai P. D., et autres
Publié: (2025)

Nonlinear Derivative-free Constrained Optimization with a Penalty-Interior Point Method and Direct Search
par: Brilli, Andrea, et autres
Publié: (2024)

Accelerated Gradient Methods with Gradient Restart: Global Linear Convergence
par: Bao, Chenglong, et autres
Publié: (2024)

Stochastic optimization over proximally smooth sets
par: Davis, Damek, et autres
Publié: (2020)

The Global R-linear Convergence of Nesterov's Accelerated Gradient Method with Unknown Strongly Convex Parameter
par: Bao, Chenglong, et autres
Publié: (2023)

The Augmented Lagrangian Methods: Overview and Recent Advances
par: Deng, Kangkang, et autres
Publié: (2025)

Proximal methods for structured nonsmooth optimization over Riemannian submanifolds
par: Li, Qia, et autres
Publié: (2024)

A Stochastic Implicit Proximal Point Algorithm for Solving Linearly Constrained Stochastic Minimax Problems
par: Zhu, Kehan, et autres
Publié: (2026)

AS-BOX: Additional Sampling Method for Weighted Sum Problems with Box Constraints
par: Krejić, Nataša, et autres
Publié: (2025)

Preconditioned Proximal Gradient Methods with Conjugate Momentum: A Subspace Perspective
par: Chen, Jian, et autres
Publié: (2026)

Local Convergence Analysis of ADMM for Nonconvex Composite Optimization
par: Xie, Xiyuan, et autres
Publié: (2026)

A New Two-dimensional Model-based Subspace Method for Large-scale Unconstrained Derivative-free Optimization: 2D-MoSub
par: Xie, Pengcheng, et autres
Publié: (2023)

Convergence-Guaranteed Algorithms for l1/2-Regularized Quadratic Programs with Assignment Constraints
par: Xie, Lijun, et autres
Publié: (2025)

MATRO: Metric-Aware Trust-Region Optimization with Fully Quadratic Models
par: Hu, Wei, et autres
Publié: (2026)

Augmented Lagrangian Functions for Cone Constrained Optimization: the Existence of Global Saddle Points and Exact Penalty Property
par: Dolgopolik, M. V.
Publié: (2017)

MGProx: A nonsmooth multigrid proximal gradient method with adaptive restriction for strongly convex optimization
par: Ang, Andersen, et autres
Publié: (2023)

A MINRES-based Linesearch Algorithm for Nonconvex Optimization with Non-positive Curvature Detection
par: Zeng, Hanfeng, et autres
Publié: (2026)

Objective-Function Free Multi-Objective Optimization: Rate of Convergence and Performance of an Adagrad-like algorithm
par: De Santis, Marianna, et autres
Publié: (2026)

Simplex Frank-Wolfe: Linear Convergence and Its Numerical Efficiency for Convex Optimization over Polytopes
par: Wang, Haoning, et autres
Publié: (2025)

A Sequential Quadratic Programming Method for Optimization with Stochastic Objective Functions, Deterministic Inequality Constraints and Robust Subproblems
par: Qiu, Songqiang, et autres
Publié: (2023)

Stochastic momentum ADMM for nonconvex and nonsmooth optimization with application to PnP algorithm
par: Deng, Kangkang, et autres
Publié: (2025)