Structured nonconvex and nonsmooth optimization: algorithms and iteration complexity analysis
type: Item
instance of: scholarly article
title: Structured nonconvex and nonsmooth optimization: algorithms and iteration complexity analysis
zbMATH Open document ID: 1411.90274
author: Bo Jiang
author: Tian-Yi Lin
author: Shiqian Ma
author: Shuzhong Zhang
published in: Computational Optimization and Applications
publication date: 2019-03-27T00:00:00Z
full work available at URL: https://arxiv.org/abs/1605.02408
Mathematics Subject Classification ID: 90C26
Mathematics Subject Classification ID: 90C06
Mathematics Subject Classification ID: 90C60
zbMATH DE Number: 7043477
zbMATH Keywords: structured nonconvex optimization
zbMATH Keywords: \(\epsilon\)-stationary
zbMATH Keywords: iteration complexity
zbMATH Keywords: conditional gradient method
zbMATH Keywords: alternating direction method of multipliers
zbMATH Keywords: block coordinate descent method
describes a project that uses: LMaFit
MaRDI profile type: Publication
OpenAlex ID: W2964271484
arXiv ID: 1605.02408
cites work: Alternating direction method of multipliers for penalized zero-variance discriminant analysis
cites work: Proximal Alternating Minimization and Projection Methods for Nonconvex Problems: An Approach Based on the Kurdyka-Łojasiewicz Inequality
cites work: Duality Between Subgradient and Conditional Gradient Methods
cites work: Linearly convergent away-step conditional gradient for non-strongly convex functions
cites work: Worst-case complexity of smoothing quadratic regularization methods for non-Lipschitzian optimization
cites work: Complexity analysis of interior point algorithms for non-Lipschitz and nonconvex minimization
cites work: The Łojasiewicz Inequality for Nonsmooth Subanalytic Functions with Applications to Subgradient Dynamical Systems
cites work: Clarke Subgradients of Stratifiable Functions
cites work: Characterizations of Łojasiewicz inequalities: Subgradient flows, talweg, convexity
cites work: Proximal alternating linearized minimization for nonconvex and nonsmooth problems
cites work: Distributed Optimization and Statistical Learning via the Alternating Direction Method of Multipliers
cites work: A forward–backward splitting algorithm for the minimization of non-smooth convex functionals in Banach space
cites work: A generalized conditional gradient method and its connection to an iterative shrinkage method
cites work: Enhancing sparsity by reweighted \(\ell _{1}\) minimization
cites work: On the Complexity of Steepest Descent, Newton's and Regularized Newton's Methods for Nonconvex Unconstrained Optimization Problems
cites work: Adaptive cubic regularisation methods for unconstrained optimization. II: Worst-case function- and derivative-evaluation complexity
cites work: An adaptive cubic regularization algorithm for nonconvex optimization with convex constraints and its function-evaluation complexity
cites work: Complexity of unconstrained \(L_2 - L_p\) minimization
cites work: A trust region algorithm with a worst-case iteration complexity of \(\mathcal{O}(\epsilon ^{-3/2})\) for nonconvex optimization
cites work: First-order methods of smooth convex optimization with inexact oracle
cites work: Approximate KKT points and a proximity measure for termination
cites work: Variable Selection via Nonconcave Penalized Likelihood and its Oracle Properties
cites work: New analysis and results for the Frank-Wolfe method
cites work: On the information-adaptive variants of the ADMM: an iteration complexity perspective
cites work: An improved algorithm for the \(L_2-L_p\) minimization problem
cites work: Mini-batch stochastic approximation methods for nonconvex stochastic composite optimization
cites work: Conditional gradient algorithms for norm-regularized smooth convex optimization
cites work: A Distributed, Asynchronous, and Incremental Algorithm for Nonconvex Optimization: An ADMM Approach
cites work: Convergence Analysis of Alternating Direction Method of Multipliers for a Family of Nonconvex Problems
cites work: Tensor and its tucker core: The invariance relationships
cites work: On gradients of functions definable in o-minimal structures
cites work: Conditional gradient sliding for convex optimization
cites work: Global Convergence of Splitting Methods for Nonconvex Composite Optimization
cites work: Global convergence of unmodified 3-block ADMM for a class of convex minimization problems
cites work: Iteration complexity analysis of multi-block ADMM for a family of convex minimization without strong convexity
cites work: A smoothing SQP framework for a class of composite \(L_q\) minimization over polyhedron
cites work: Conditional Gradient Algorithmsfor Rank-One Matrix Approximations with a Sparsity Constraint
cites work: Cubic-regularization counterpart of a variable-norm trust-region method for unconstrained minimization
cites work: Scalable robust matrix recovery: Frank-Wolfe meets proximal methods
cites work: Introductory lectures on convex optimization. A basic course.
cites work: Extensions of Fréchet \(\varepsilon\)-subdifferential calculus and applications
cites work: Variational Analysis
cites work: Augmented Lagrangian alternating direction method for matrix separation based on low-rank factorization
cites work: Solving a low-rank factorization model for matrix completion by a nonlinear successive over-relaxation algorithm
cites work: Alternating proximal gradient method for sparse nonnegative Tucker decomposition
cites work: Alternating Direction Method of Multipliers for a Class of Nonconvex and Nonsmooth Problems with Applications to Background/Foreground Extraction
cites work: Generalized Conditional Gradient for Sparse Estimation
cites work: Nearly unbiased variable selection under minimax concave penalty
cites work: Analysis of multi-stage convex relaxation for sparse regularization
cites work: Multi-stage convex relaxation for feature selection
Wikidata QID: Q129193937
DOI: 10.1007/S10589-018-0034-Y
description: scientific article