Copertina

A simple inverse power method for balanced graph cut

Fuente: arXiv

Salvato in:

Dettagli Bibliografici
Autori principali:	Shao, Sihong, Yang, Chuan
Natura:	Preprint
Pubblicazione:	2024
Soggetti:	Optimization and Control Numerical Analysis Combinatorics Spectral Theory 90C27, 05C50, 90C32, 35P30, 90C26
Accesso online:	Acceder al recurso
Tags:	Aggiungi Tag Nessun Tag, puoi essere il primo ad aggiungerne!!

Documenti analoghi

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

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

Dual Cheeger Constants, Signless 1-Laplacians and Maxcut
di: Shao, Sihong, et al.
Pubblicazione: (2016)

A simple iterative algorithm for maxcut
di: Shao, Sihong, et al.
Pubblicazione: (2018)

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

Lagrangian Reformulation for Nonconvex Optimization: Tailoring Problems to Specialized Solvers
di: Quintero, Rodolfo A., et al.
Pubblicazione: (2024)

Benign landscapes of low-dimensional relaxations for orthogonal synchronization on general graphs
di: McRae, Andrew D., et al.
Pubblicazione: (2023)

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

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

An ODE approach to multiple choice polynomial programming
di: Shao, Sihong, et al.
Pubblicazione: (2022)

On generalized KKT points for the Motzkin-Straus program
di: Beretta, G., et al.
Pubblicazione: (2023)

Edge expansion of a graph: SDP-based computational strategies
di: Gupte, Akshay, et al.
Pubblicazione: (2024)

An Integer Linear Programming Model for the Evolomino Puzzle
di: Nikolaev, Andrei V., et al.
Pubblicazione: (2026)

A Canceling Heuristic for the Directed Traveling Salesman Problem
di: Borgwardt, Steffen, et al.
Pubblicazione: (2026)

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

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

Fixed Topology Minimum-Length Trees with Neighborhoods
di: Blanco, Víctor, et al.
Pubblicazione: (2024)

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

New vector transport operators extending a Riemannian CG algorithm to generalized Stiefel manifold with low-rank applications
di: Wang, Xuejie, et al.
Pubblicazione: (2023)

Proximal Nonlinear Conjugate Gradient Methods for Composite Optimization
di: Hamana, Shodai, et al.
Pubblicazione: (2026)

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

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

Finding Short Paths on Simple Polytopes
di: Black, Alexander E., et al.
Pubblicazione: (2026)

Optimization over convex polyhedra via Hadamard parametrizations
di: Tang, Tianyun, et al.
Pubblicazione: (2024)

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

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

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

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

Delayed Feedback in Online Non-Convex Optimization: A Non-Stationary Approach with Applications
di: Lara, Felipe, et al.
Pubblicazione: (2024)

Randomized block proximal method with locally Lipschitz continuous gradient
di: Pérez-Aros, Pedro, et al.
Pubblicazione: (2025)

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

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

Closing the duality gap of the generalized trace ratio problem
di: Yang, Meijia, et al.
Pubblicazione: (2024)

Optimality Conditions and Duality for Multiobjective Fractional Bilevel Optimization Problems
di: Lara, Felipe, et al.
Pubblicazione: (2025)

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

On Optimality Conditions for Mathematical Programming Problems Based on Strong Subdifferentials
di: Lara, Felipe, et al.
Pubblicazione: (2026)

Penalty decomposition derivative free method for the minimization of partially separable functions over a convex feasible set
di: Cecere, Francesco, et al.
Pubblicazione: (2025)

Proximal methods for structured nonsmooth optimization over Riemannian submanifolds
di: Li, Qia, et al.
Pubblicazione: (2024)

A heavy-ball type curve search method for smooth convexly constrained optimization
di: Donnini, Federica, et al.
Pubblicazione: (2026)

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