Cover Image

An efficient penalty decomposition algorithm for minimization over sparse symmetric sets

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Mousavi, Ahmad, Kimiaei, Morteza, Babaie-Kafaki, Saman, Kungurtsev, Vyacheslav
Format:	Preprint
Published:	2026
Subjects:	Optimization and Control 90C30
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

A Sequential Quadratic Programming Method for Optimization with Stochastic Objective Functions, Deterministic Inequality Constraints and Robust Subproblems
by: Qiu, Songqiang, et al.
Published: (2023)

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

Machine Learning Algorithms for Improving Black Box Optimization Solvers
by: Kimiaei, Morteza, et al.
Published: (2025)

Worst case complexity bounds for linesearch-type derivative-free algorithms
by: Brilli, Andrea, et al.
Published: (2023)

A modified exact penalty approach for general constrained $\ell_0$-sparse optimization problems
by: Kanzow, Christian, et al.
Published: (2025)

A computationally efficient arc-search interior-point algorithm for nonlinear constrained optimization
by: Yang, Yaguang
Published: (2024)

Optimality conditions for problems over symmetric cones and a simple augmented Lagrangian method
by: Lourenço, Bruno F., et al.
Published: (2017)

Nonsmooth exact penalty methods for equality-constrained optimization: complexity and implementation
by: Diouane, Youssef, et al.
Published: (2024)

PANOC-lite: A simpler and more efficient algorithm for composite minimization
by: Bodard, Alexander, et al.
Published: (2026)

Projection-based curve pattern search for black-box optimization over smooth convex sets
by: Jia, Xiaoxi, et al.
Published: (2025)

Time-Varying Semidefinite Programming: Path Following a Burer-Monteiro Factorization
by: Bellon, Antonio, et al.
Published: (2022)

An investigation of stochastic trust-region based algorithms for finite-sum minimization
by: Bellavia, Stefania, et al.
Published: (2024)

A four-operator splitting algorithm for nonconvex and nonsmooth optimization
by: Alcantara, Jan Harold, et al.
Published: (2024)

An adaptive ADMM with regularized spectral penalty for sparse portfolio selection
by: Xu, Xin
Published: (2025)

An arc-search BFGS algorithm for unconstrained nonlinear optimization problems
by: Yang, Yaguang
Published: (2026)

On the solution set of semi-infinite tensor complementarity problem
by: Deb, R., et al.
Published: (2023)

Steering exact penalty DCA for nonsmooth DC optimization problems with equality and inequality constraints
by: Dolgopolik, M. V.
Published: (2021)

Continuous models combining slacks-based measures of efficiency and super-efficiency
by: Bolos, Vicente J., et al.
Published: (2024)

Existence of augmented Lagrange multipliers: reduction to exact penalty functions and localization principle
by: Dolgopolik, M. V.
Published: (2018)

Benders decomposition algorithms for minimizing the spread of harmful contagions in networks
by: Tanınmış, Kübra, et al.
Published: (2023)

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

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

A nonsmooth Frank-Wolfe algorithm through a dual cutting-plane approach
by: Mazanti, Guilherme, et al.
Published: (2024)

Bound tightening in lifted formulations: (sub)solver-dependent impact on performance in RLT-based algorithms
by: González-Díaz, Julio, et al.
Published: (2025)

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

Machine Learning Algorithms for Improving Exact Classical Solvers in Mixed Integer Continuous Optimization
by: Kimiaei, Morteza, et al.
Published: (2025)

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

Global convergence of the gradient method for functions definable in o-minimal structures
by: Josz, Cédric
Published: (2023)

Nonsmooth convex-concave saddle point problems with cardinality penalties
by: Bian, Wei, et al.
Published: (2024)

On the convergence of adaptive first order methods: proximal gradient and alternating minimization algorithms
by: Latafat, Puya, et al.
Published: (2023)

Direct-search methods for decentralized blackbox optimization
by: Bergou, El Houcine, et al.
Published: (2025)

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

Alternating minimization for square root principal component pursuit
by: Deng, Shengxiang, et al.
Published: (2024)

Decision-focused predictions via pessimistic bilevel optimization: complexity and algorithms
by: Bucarey, Víctor, et al.
Published: (2023)

Stochastic optimization over proximally smooth sets
by: Davis, Damek, et al.
Published: (2020)

Two trust region type algorithms for solving nonconvex-strongly concave minimax problems
by: Yao, Tongliang, et al.
Published: (2024)

Splitting Proximal Point Algorithms for the Sum of Prox-Convex Functions
by: de Brito, Jose, et al.
Published: (2026)

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

A Nonmonotone Front Descent Method for Bound-Constrained Multi-Objective Optimization
by: Mansueto, Pierluigi
Published: (2025)

Extending Linear Convergence of the Proximal Point Algorithm: The Quasar-Convex Case
by: de Brito, José, et al.
Published: (2025)