:: Library Catalog

Cover Image

Saved in:

Bibliographic Details
Main Authors:	Shen, Yuting, Liang, Jingwei
Format:	Preprint
Published:	2025
Subjects:	Optimization and Control
Online Access:	https://arxiv.org/abs/2504.11313
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

An SDP Relaxation for the Sparse Integer Least Squares Problem
by: Del Pia, Alberto, et al.
Published: (2022)

An Analysis of Constraint-Relaxation in PDE-Based Inverse Problems
by: van Leeuwen, Tristan, et al.
Published: (2024)

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

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