Cover Image

A polynomial projective algorithm for convex feasibility problems with positive-definite constraints

Fuente: arXiv

Saved in:

Bibliographic Details
Main Author:	Chubanov, Sergei
Format:	Preprint
Published:	2025
Subjects:	Optimization and Control 90C22
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Duality attainment and strict feasibility of the generalized moment problem and its relaxations
by: Halaseh, Sami, et al.
Published: (2026)

Sparse convex relaxations in polynomial optimization
by: Averkov, Gennadiy, et al.
Published: (2024)

A feasible smoothing accelerated projected gradient method for nonsmooth convex optimization
by: Nishioka, Akatsuki, et al.
Published: (2023)

Superlinear Convergence of an Interior Point Algorithm on Linear Semi-definite Feasibility Problems
by: Sim, Chee-Khian
Published: (2022)

On the convexity for the range set of two quadratic functions
by: Nguyen, Huu-Quang, et al.
Published: (2025)

A parameter-free approach for solving SOS-convex semi-algebraic fractional programs
by: Yang, Chengmiao, et al.
Published: (2024)

Sum-of-squares hierarchies for polynomial optimization and the Christoffel-Darboux kernel
by: Slot, Lucas
Published: (2021)

T-semidefinite programming relaxation with third-order tensors for constrained polynomial optimization
by: Marumo, Hiroki, et al.
Published: (2024)

Soft quasi-Newton: Guaranteed positive definiteness by relaxing the secant constraint
by: Berglund, Erik, et al.
Published: (2024)

Hidden convexity, optimization, and algorithms on rotation matrices
by: Ramachandran, Akshay, et al.
Published: (2023)

A new dual spectral projected gradient method for log-determinant semidefinite programming with hidden clustering structures
by: Namchaisiri, Charles, et al.
Published: (2024)

Nonconvergence of a sum-of-squares hierarchy for global polynomial optimization based on push-forward measures
by: Slot, Lucas, et al.
Published: (2024)

A preconditioned augmented Lagrangian method for solving semidefinite programming problems
by: Tang, Tianyun, et al.
Published: (2026)

Sum-of-squares certificates for symmetric polynomials on the hypercube: a counterexample to a conjecture of De Klerk and Laurent
by: Polak, Sven
Published: (2026)

A polynomial time infeasible interior-point arc-search algorithm for convex optimization
by: Yang, Yaguang
Published: (2022)

A minimal face constant rank constraint qualification for reducible conic programming
by: Andreani, Roberto, et al.
Published: (2023)

On exactness of SDP relaxation for the maximum cut problem
by: Bhardwaj, Avinash, et al.
Published: (2025)

A constraint-based approach to function interpolation, with application to performance estimation for weakly convex optimisation
by: Rubbens, Anne, et al.
Published: (2024)

Second-order sequential optimality conditions for nonlinear semidefinite optimization problems
by: Li, Huimin, et al.
Published: (2025)

Exact SDP relaxations for a class of quadratic programs with finite and infinite quadratic constraints
by: Arima, Naohiko, et al.
Published: (2024)

Decentralized projected Riemannian stochastic recursive momentum method for nonconvex optimization
by: Deng, Kangkang, et al.
Published: (2024)

A globally convergent SQP-type method with least constraint violation for nonlinear semidefinite programming
by: Fu, Wenhao, et al.
Published: (2023)

On convergence of a $q$-random coordinate constrained algorithm for non-convex problems
by: Ghaffari-Hadigheh, Alireza, et al.
Published: (2022)

A more efficient reformulation of complex SDP as real SDP
by: Wang, Jie
Published: (2023)

Beyond binarity: Semidefinite programming for ternary quadratic problems
by: de Meijer, Frank, et al.
Published: (2026)

A Moment-QSOS Hierarchy for a Class of Quaternion Polynomial Optimization Problems
by: Liu, Yanqing, et al.
Published: (2026)

A semidefinite programming hierarchy for covering problems in discrete geometry
by: Riener, Cordian, et al.
Published: (2023)

On generators of $k$-PSD closures of the positive semidefinite cone
by: Bhardwaj, Avinash, et al.
Published: (2024)

Extragradient method with feasible inexact projection to variational inequality problem
by: Millán, R. Díaz, et al.
Published: (2023)

An efficient proximal algorithm for squared L1 over L2 regularized sparse recovery
by: Zhang, Na, et al.
Published: (2025)

The exact subgraph hierarchy and its vertex-transitive variant for the stable set problem for Paley graphs
by: Gaar, Elisabeth, et al.
Published: (2024)

Moment-sos and spectral hierarchies for polynomial optimization on the sphere and quantum de Finetti theorems
by: Blomenhofer, Alexander Taveira, et al.
Published: (2024)

SDP bounds on the stability number via ADMM and intermediate levels of the Lasserre hierarchy
by: Sinjorgo, Lennart, et al.
Published: (2025)

DC Semidefinite Programming and Cone Constrained DC Optimization: Theory and Local Search Methods
by: Dolgopolik, M. V.
Published: (2021)

The link between $1$-norm approximation and effective Positivstellensatze for the hypercube
by: de Klerk, Etienne, et al.
Published: (2024)

Practical Experience with Stable Set and Coloring Relaxations
by: Pucher, Dunja, et al.
Published: (2024)

An Overview of Convergence Rates for Sum of Squares Hierarchies in Polynomial Optimization
by: Laurent, Monique, et al.
Published: (2024)

Piecewise SOS-Convex Moment Optimization and Applications via Exact Semi-Definite Programs
by: Huang, Queenie Yingkun, et al.
Published: (2024)

Approximations of unbounded convex projections and unbounded convex sets
by: Kováčová, Gabriela, et al.
Published: (2023)

Upper bound hierarchies for noncommutative polynomial optimization
by: Klep, Igor, et al.
Published: (2024)