Block coordinate descent for smooth nonconvex constrained minimization
type: Item
instance of: scholarly article
title: Block coordinate descent for smooth nonconvex constrained minimization
zbMATH Open document ID: 1496.90092
author: E. G. Birgin
author: J. M. Martínez
published in: Computational Optimization and Applications
publication date: 2022-08-08T00:00:00Z
full work available at URL: https://arxiv.org/abs/2111.13103
Mathematics Subject Classification ID: 90C30
Mathematics Subject Classification ID: 65K05
Mathematics Subject Classification ID: 49M37
Mathematics Subject Classification ID: 90C60
Mathematics Subject Classification ID: 68Q25
zbMATH DE Number: 7569390
zbMATH Keywords: coordinate descent methods
zbMATH Keywords: convergence
zbMATH Keywords: complexity
MaRDI profile type: MaRDI publication profile
OpenAlex ID: W3217235274
cites work: Q4421940
cites work: The traveling salesman problem. A computational study.
cites work: Worst-case evaluation complexity for unconstrained nonlinear optimization using high-order regularized models
cites work: On regularization and active-set methods with complexity for constrained optimization
cites work: A Newton-like method with mixed factorizations and cubic regularization for unconstrained minimization
cites work: A cyclic block coordinate descent method with generalized gradient projections
cites work: New Insertion and Postoptimization Procedures for the Traveling Salesman Problem
cites work: Q5491447
cites work: On search directions for minimization algorithms
cites work: Coordinate descent algorithms
DOI: 10.1007/S10589-022-00389-5
Recommended article: Block-coordinate gradient descent method for linearly constrained nonsmooth separable optimization
Recommended article: Inexact Block Coordinate Descent Algorithms for Nonsmooth Nonconvex Optimization
Recommended article: Convergence of a block coordinate descent method for nondifferentiable minimization
Recommended article: A block-coordinate descent method for linearly constrained minimization problem
Recommended article: Block coordinate descent methods for semidefinite programming
Recommended article: Block-coordinate primal-dual method for nonsmooth minimization over linear constraints
Recommended article: On the convergence of inexact block coordinate descent methods for constrained optimization
Recommended article: Block stochastic gradient iteration for convex and nonconvex optimization
Recommended article: On the convergence of block coordinate descent type methods
Recommended article: Block coordinate proximal gradient methods with variable Bregman functions for nonsmooth separable optimization
description: scientific article; zbMATH DE number 7569390