Imagen de Portada

A Composed Alternating Relaxed Projection Algorithm for Feasibility Problem

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Shen, Yuting, Liang, Jingwei
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

Generalized Composed Alternating Relaxed Projection Algorithm for Two-Set Feasibility Problem
por: Li, Xinxin, et al.
Publicado: (2026)

Derivative-free Alternating Projection Algorithms for General Nonconvex-Concave Minimax Problems
por: Xu, Zi, et al.
Publicado: (2021)

Generalized Bregman Projection Algorithms for Solving Nonlinear Split Feasibility Problems in Infinite-Dimensional Spaces
por: Sababe, Saeed Hashemi, et al.
Publicado: (2025)

Randomized Feasibility-Update Algorithms for Variational Inequality Problems
por: Chakraborty, Abhishek, et al.
Publicado: (2024)

Randomized Feasibility-Update Algorithms for Stochastic Variational Inequality Problems
por: Chakraborty, Abhishek, et al.
Publicado: (2025)

Projection-Free Algorithms for Minimax Problems
por: Giang-Tran, Khanh-Hung, et al.
Publicado: (2026)

Variance Reduced Random Relaxed Projection Method for Constrained Finite-sum Minimization Problems
por: Yang, Zhichun, et al.
Publicado: (2022)

Affine FR: an Effective Facial Reduction Algorithm for Semidefinite Relaxations of Combinatorial Problems
por: Hu, Hao, et al.
Publicado: (2024)

From Majorization to Scaling: Advancing Convex Relaxations of Maximum Entropy Sampling Problem
por: Shen, Lingqing, et al.
Publicado: (2026)

Formalization of Two Fixed-Point Algorithms in Hilbert Spaces
por: Bai, Yifan, et al.
Publicado: (2026)

A Feasible Sequential Linear Programming Algorithm with Application to Time-Optimal Path Planning Problems
por: Kiessling, David, et al.
Publicado: (2022)

Zeroth-Order primal-dual Alternating Projection Gradient Algorithms for Nonconvex Minimax Problems with Coupled linear Constraints
por: Zhang, Huiling, et al.
Publicado: (2024)

A Riemannian Alternating Descent Ascent Algorithmic Framework for Nonconvex-Linear Minimax Problems on Riemannian Manifolds
por: Xu, Meng, et al.
Publicado: (2024)

A Tight SDP Relaxation for the Cubic-Quartic Regularization Problem
por: Zhou, Jinling, et al.
Publicado: (2025)

Variable Projection Algorithms: Theoretical Insights and A Novel Approach for Problems with Large Residual
por: Chen, Guangyong, et al.
Publicado: (2024)

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

Exactness Conditions for Semidefinite Relaxations of the Quadratic Assignment Problem
por: Chen, Junyu, et al.
Publicado: (2024)

A Canonical Structure for Constructing Projected First-Order Algorithms With Delayed Feedback
por: Li, Mengmou, et al.
Publicado: (2026)

Leveraging Convex Relaxation to Identify the Feasibility of Conducting AC False Data Injection Attack in Power Systems
por: Iranpour, Mohammadreza, et al.
Publicado: (2025)

Generalized Alternating Projections on Manifolds and Convex Sets
por: Fält, Mattias, et al.
Publicado: (2021)

Single-loop Projection-free and Projected Gradient-based Algorithms for Nonconvex-concave Saddle Point Problems with Bilevel Structure
por: Ahmadi, Mohammad Mahdi, et al.
Publicado: (2024)

A Quadratically Convergent Alternating Projection Method for Nonconvex Sets
por: Xiao, Nachuan, et al.
Publicado: (2025)

Sufficient A Priori Conditions for the Linear Relaxation of the Energy Storage Scheduling Problem
por: Prat, Eléa, et al.
Publicado: (2025)

An Almost Feasible Sequential Linear Programming Algorithm
por: Kiessling, David, et al.
Publicado: (2024)

Mesh Refinement with Early Termination for Dynamic Feasibility Problems
por: Vila, Eduardo M. G., et al.
Publicado: (2024)

Tightening Quadratic Convex Relaxations for the AC Optimal Transmission Switching Problem
por: Guo, Cheng, et al.
Publicado: (2022)

A Modelling Framework for Energy-Management and Eco-Driving Problems using Convex Relaxations
por: Heuts, Y. J. J., et al.
Publicado: (2024)

Modelling to Generate Continuous Alternatives: Enabling Real-Time Feasible Portfolio Generation in Convex Planning Models
por: Lau, Michael, et al.
Publicado: (2024)

FORWARD: A Feasible Radial Reconfiguration Algorithm for Multi-Source Distribution Networks
por: Gallart, Joan Vendrell, et al.
Publicado: (2025)

ROS: A GNN-based Relax-Optimize-and-Sample Framework for Max-k-Cut Problems
por: Qiu, Yeqing, et al.
Publicado: (2024)

Relaxed Proximal Point Algorithm: Tight Complexity Bounds and Acceleration without Momentum
por: Wang, Bofan, et al.
Publicado: (2024)

Superquantile-Gibbs Relaxation for Minima-selection in Bilevel Optimization
por: Masiha, Saeed, et al.
Publicado: (2025)

A Parallelized Cutting-Plane Algorithm for Computationally Efficient Modelling to Generate Alternatives
por: Lau, Michael, et al.
Publicado: (2025)

On Semidefinite Relaxations for Matrix-Weighted State-Estimation Problems in Robotics
por: Holmes, Connor, et al.
Publicado: (2023)

A Dynamic Relaxation Framework for Global Solution of ACOPF
por: Tang, Yu-Yang, et al.
Publicado: (2025)

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

An Online Algorithm for Solving Feedback Optimal Control Problems with Partial Observations
por: Liang, Siming, et al.
Publicado: (2024)

A Relaxed Control Problem With $L^\infty$ Cost and Jump Dynamics Motivated by Cyber Risks Insurance
por: Goreac, Dan, et al.
Publicado: (2025)

Relaxed Lagrangian Approach to First-Order Non-Convex Mean Field Type Control Problem
por: Mendico, Cristian, et al.
Publicado: (2024)

A Block-Alternating Iterative Approach for a Class of Non-Convex Optimization Problems
por: Li, Anran, et al.
Publicado: (2026)