Copertina

On the efficient computation of proximal operators of affine-constrained nonconvex functions

Fuente: arXiv

Salvato in:

Dettagli Bibliografici
Autori principali:	Hou, Di, Tang, Tianyun, Toh, Kim-Chuan, Wang, Shiwei
Natura:	Preprint
Pubblicazione:	2026
Soggetti:	Optimization and Control
Accesso online:	Acceder al recurso
Tags:	Aggiungi Tag Nessun Tag, puoi essere il primo ad aggiungerne!!

Documenti analoghi

On the B-subdifferential of proximal operators of affine-constrained $\ell_1$ regularizer
di: Li, Xudong, et al.
Pubblicazione: (2025)

RiNNAL+: a Riemannian ALM Solver for SDP-RLT Relaxations of Mixed-Binary Quadratic Programs
di: Hou, Di, et al.
Pubblicazione: (2025)

An Exact Penalty Approach for Equality Constrained Optimization over a Convex Set
di: Xiao, Nachuan, et al.
Pubblicazione: (2025)

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

On exploration of an interior mirror descent flow for stochastic nonconvex constrained problem
di: Ding, Kuangyu, et al.
Pubblicazione: (2025)

A Low-rank Augmented Lagrangian Method for Polyhedral-SDP and Moment-SOS Relaxations of Polynomial Optimization
di: Hou, Di, et al.
Pubblicazione: (2025)

A low-rank augmented Lagrangian method for doubly nonnegative relaxations of mixed-binary quadratic programs
di: Hou, Di, et al.
Pubblicazione: (2025)

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

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

Exploring chordal sparsity in semidefinite programming with sparse plus low-rank data matrices
di: Tang, Tianyun, et al.
Pubblicazione: (2024)

Accelerating nuclear-norm regularized low-rank matrix optimization through Burer-Monteiro decomposition
di: Lee, Ching-pei, et al.
Pubblicazione: (2022)

A Minimization Approach for Minimax Optimization with Coupled Constraints
di: Hu, Xiaoyin, et al.
Pubblicazione: (2024)

A Bregman ADMM for Bethe variational problem
di: Khoo, Yuehaw, et al.
Pubblicazione: (2025)

Adaptive directional decomposition methods for nonconvex constrained optimization
di: Shi, Qiankun, et al.
Pubblicazione: (2025)

An implementable proximal-type method for computing critical points to minimization problems with a nonsmooth and nonconvex constraint
di: Sempere, Gregorio M., et al.
Pubblicazione: (2024)

Stochastic Bregman Subgradient Methods for Nonsmooth Nonconvex Optimization Problems
di: Ding, Kuangyu, et al.
Pubblicazione: (2024)

Inexact Bregman Proximal Gradient Method and its Inertial Variant with Absolute and Partial Relative Stopping Criteria
di: Yang, Lei, et al.
Pubblicazione: (2021)

On the convergence rates of moment-SOS hierarchies approximation of truncated moment sequences
di: Tran, Hoang Anh, et al.
Pubblicazione: (2025)

Frank-Wolfe-type methods for a class of nonconvex inequality-constrained problems
di: Zeng, Liaoyuan, et al.
Pubblicazione: (2021)

An inexact $q$-order regularized proximal Newton method for nonconvex composite optimization
di: Liu, Ruyu, et al.
Pubblicazione: (2023)

Extended alternating structure-adapted proximal gradient algorithm for nonconvex nonsmooth problems
di: Gao, Ying, et al.
Pubblicazione: (2024)

Robust principal component analysis with rank and cardinality regularization under matrix factorization
di: Li, Wenjing, et al.
Pubblicazione: (2026)

An Inexact Bregman Proximal Difference-of-Convex Algorithm with Two Types of Relative Stopping Criteria
di: Yang, Lei, et al.
Pubblicazione: (2024)

A relaxed proximal point algorithm with double-inertial effects for nonconvex equilibrium problems
di: Van Tran, Nam
Pubblicazione: (2025)

A Sparse Smoothing Newton Method for Solving Discrete Optimal Transport Problems
di: Hou, Di, et al.
Pubblicazione: (2023)

On second-order weak sharp minima of general nonconvex set-constrained optimization problems
di: Ma, Xiaoxiao, et al.
Pubblicazione: (2025)

Wasserstein distributionally robust optimization and its tractable regularization formulations
di: Chu, Hong T. M., et al.
Pubblicazione: (2024)

The inexact power augmented Lagrangian method for constrained nonconvex optimization
di: Bodard, Alexander, et al.
Pubblicazione: (2024)

Newton and interior-point methods for (constrained) nonconvex-nonconcave minmax optimization with stability and instability guarantees
di: Chinchilla, Raphael, et al.
Pubblicazione: (2022)

Block majorization-minimization with diminishing radius for constrained nonsmooth nonconvex optimization
di: Lyu, Hanbaek, et al.
Pubblicazione: (2020)

ripALM: A Relative-Type Inexact Proximal Augmented Lagrangian Method for Linearly Constrained Convex Optimization
di: Zhu, Jiayi, et al.
Pubblicazione: (2024)

Learning-rate-free Momentum SGD with Reshuffling Converges in Nonsmooth Nonconvex Optimization
di: Hu, Xiaoyin, et al.
Pubblicazione: (2024)

Partial Envelope for Optimization Problem with Nonconvex Constraints
di: Hu, Xiaoyin, et al.
Pubblicazione: (2025)

Convergence Analysis of a Relative-type Inexact Preconditioned Proximal ALM for Convex Nonlinear Programming
di: Yang, Lei, et al.
Pubblicazione: (2025)

Adaptive sieving: A dimension reduction technique for sparse optimization problems
di: Yuan, Yancheng, et al.
Pubblicazione: (2023)

A Hybrid Subgradient Method for Nonsmooth Nonconvex Bilevel Optimization
di: Xiao, Nachuan, et al.
Pubblicazione: (2025)

Characterizations of inexact proximal operators
di: Lauga, Guillaume, et al.
Pubblicazione: (2026)

Nonconvex Stochastic Bregman Proximal Gradient Method with Application to Deep Learning
di: Ding, Kuangyu, et al.
Pubblicazione: (2023)

Learning Graph Laplacian with MCP
di: Zhang, Yangjing, et al.
Pubblicazione: (2020)

Calculus rules for proximal ε-subdifferentials and inexact proximity operators for weakly convex functions
di: Bednarczuk, Ewa, et al.
Pubblicazione: (2022)