Cover Image

A simple iterative algorithm for maxcut

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Shao, Sihong, Zhang, Dong, Zhang, Weixi
Format:	Preprint
Published:	2018
Subjects:	Optimization and Control Numerical Analysis Combinatorics 90C27, 05C85, 65K10, 90C26, 90C32
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Continuous iterative algorithms for anti-Cheeger cut
by: Shao, Sihong, et al.
Published: (2021)

A simple inverse power method for balanced graph cut
by: Shao, Sihong, et al.
Published: (2024)

Stochastic momentum ADMM for nonconvex and nonsmooth optimization with application to PnP algorithm
by: Deng, Kangkang, et al.
Published: (2025)

Globally Optimal Solutions to a Class of Fractional Optimization Problems Based on Proximal Gradient Algorithm
by: Lin, Yizun, et al.
Published: (2023)

A min-max reformulation and proximal algorithms for a class of structured nonsmooth fractional optimization problems
by: Zhou, Junpeng, et al.
Published: (2025)

A full splitting algorithm for fractional programs with structured numerators and denominators
by: Boţ, Radu Ioan, et al.
Published: (2023)

Tight Error Bounds for the Sign-Constrained Stiefel Manifold
by: Chen, Xiaojun, et al.
Published: (2022)

Conductance Estimation in Digraphs: Submodular Transformation, Lovász Extension and Dinkelbach Iteration
by: Shao, Sihong, et al.
Published: (2025)

A Single-loop Proximal Subgradient Algorithm for A Class Structured Fractional Programs
by: Han, Deren, et al.
Published: (2025)

A Globally Optimal Portfolio for m-Sparse Sharpe Ratio Maximization
by: Lin, Yizun, et al.
Published: (2024)

AS-BOX: Additional Sampling Method for Weighted Sum Problems with Box Constraints
by: Krejić, Nataša, et al.
Published: (2025)

Exact Solutions for the NP-hard Wasserstein Barycenter Problem using a Doubly Nonnegative Relaxation and a Splitting Method
by: Jung, Woosuk L., et al.
Published: (2023)

A New Linear Programming Approach and a New Backtracking Strategy for Multiple-Gradient Descent in Multi-Objective Optimization
by: Della Santa, Francesco
Published: (2024)

A low-rank augmented Lagrangian method for large-scale semidefinite programming based on a hybrid convex-nonconvex approach
by: Monteiro, Renato D. C., et al.
Published: (2024)

Inexact Riemannian Gradient Descent Method for Nonconvex Optimization
by: Zhou, Juan, et al.
Published: (2024)

A Convergent ADMM Algorithm for Grain Boundary Energy Minimization
by: Wu, Yue, et al.
Published: (2024)

The Boolean polynomial polytope with multiple choice constraints
by: Shao, Sihong, et al.
Published: (2024)

A novel numerical method tailored for unconstrained optimization problems
by: Li, Lin, et al.
Published: (2025)

An apocalypse-free first-order low-rank optimization algorithm with at most one rank reduction attempt per iteration
by: Olikier, Guillaume, et al.
Published: (2022)

Steiner Cut Dominants
by: Conforti, Michele, et al.
Published: (2022)

Parameter-Free Accelerated Quasi-Newton Method for Nonconvex Optimization
by: Marumo, Naoki
Published: (2025)

Oracle complexities of augmented Lagrangian methods for nonsmooth manifold optimization
by: Deng, Kangkang, et al.
Published: (2024)

A Busemann hybrid projection-proximal point algorithm for optimization problems on Hadamard manifolds
by: Millán, R. Díaz, et al.
Published: (2026)

Variance-reduced first-order methods for deterministically constrained stochastic nonconvex optimization with strong convergence guarantees
by: Lu, Zhaosong, et al.
Published: (2024)

Optimization in complex spaces with the Mixed Newton Method
by: Bakhurin, Sergey, et al.
Published: (2022)

A globalization of L-BFGS and the Barzilai-Borwein method for nonconvex unconstrained optimization
by: Mannel, Florian
Published: (2024)

A preconditioned difference of convex functions algorithm with extrapolation and line search
by: Zhang, Ran, et al.
Published: (2025)

A first-order method for nonconvex-nonconcave minimax problems under a local Kurdyka-Lojasiewicz condition
by: Lu, Zhaosong, et al.
Published: (2025)

A first-order augmented Lagrangian method for constrained minimax optimization
by: Lu, Zhaosong, et al.
Published: (2023)

First-order penalty methods for bilevel optimization
by: Lu, Zhaosong, et al.
Published: (2023)

Solving bilevel optimization via sequential minimax optimization
by: Lu, Zhaosong, et al.
Published: (2025)

A first-order method for nonconvex-strongly-concave constrained minimax optimization
by: Lu, Zhaosong, et al.
Published: (2025)

ASPEN: An Additional Sampling Penalty Method for Finite-Sum Optimization Problems with Nonlinear Equality Constraints
by: Krejić, Nataša, et al.
Published: (2025)

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

Extrapolated Plug-and-Play Three-Operator Splitting Methods for Nonconvex Optimization with Applications to Image Restoration
by: Wu, Zhongming, et al.
Published: (2024)

A stochastic use of the Kurdyka-Lojasiewicz property: Investigation of optimization algorithms behaviours in a non-convex differentiable framework
by: Fest, Jean-Baptiste, et al.
Published: (2023)

Flexible block-iterative analysis for the Frank-Wolfe algorithm
by: Braun, Gábor, et al.
Published: (2024)

A structured L-BFGS method and its application to inverse problems
by: Mannel, Florian, et al.
Published: (2023)

A structured L-BFGS method with diagonal scaling and its application to image registration
by: Mannel, Florian, et al.
Published: (2024)

Anderson Accelerated Primal-Dual Hybrid Gradient for solving LP
by: Zhou, Yingxin, et al.
Published: (2025)