Structured nonconvex and nonsmooth optimization: algorithms and iteration complexity analysis
Published 2018 View Full Article
- Home
- Publications
- Publication Search
- Publication Details
Title
Structured nonconvex and nonsmooth optimization: algorithms and iteration complexity analysis
Authors
Keywords
-
Journal
COMPUTATIONAL OPTIMIZATION AND APPLICATIONS
Volume -, Issue -, Pages -
Publisher
Springer Nature America, Inc
Online
2018-09-25
DOI
10.1007/s10589-018-0034-y
References
Ask authors/readers for more resources
Related references
Note: Only part of the references are listed.- Global Convergence of ADMM in Nonconvex Nonsmooth Optimization
- (2018) Yu Wang et al. JOURNAL OF SCIENTIFIC COMPUTING
- Global Convergence of Unmodified 3-Block ADMM for a Class of Convex Minimization Problems
- (2017) Tianyi Lin et al. JOURNAL OF SCIENTIFIC COMPUTING
- On the Information-Adaptive Variants of the ADMM: An Iteration Complexity Perspective
- (2017) Xiang Gao et al. JOURNAL OF SCIENTIFIC COMPUTING
- An improved algorithm for the L 2 – L p minimization problem
- (2017) Dongdong Ge et al. MATHEMATICAL PROGRAMMING
- Tensor and its tucker core: The invariance relationships
- (2017) Bo Jiang et al. NUMERICAL LINEAR ALGEBRA WITH APPLICATIONS
- Alternating Direction Method of Multipliers for a Class of Nonconvex and Nonsmooth Problems with Applications to Background/Foreground Extraction
- (2017) Lei Yang et al. SIAM Journal on Imaging Sciences
- Alternating direction method of multipliers for penalized zero-variance discriminant analysis
- (2016) Brendan P. W. Ames et al. COMPUTATIONAL OPTIMIZATION AND APPLICATIONS
- Cubic-regularization counterpart of a variable-norm trust-region method for unconstrained minimization
- (2016) J. M. Martínez et al. JOURNAL OF GLOBAL OPTIMIZATION
- Iteration Complexity Analysis of Multi-block ADMM for a Family of Convex Minimization Without Strong Convexity
- (2016) Tianyi Lin et al. JOURNAL OF SCIENTIFIC COMPUTING
- Linearly convergent away-step conditional gradient for non-strongly convex functions
- (2016) Amir Beck et al. MATHEMATICAL PROGRAMMING
- A trust region algorithm with a worst-case iteration complexity of $$\mathcal{O}(\epsilon ^{-3/2})$$ O ( ϵ - 3 / 2 ) for nonconvex optimization
- (2016) Frank E. Curtis et al. MATHEMATICAL PROGRAMMING
- Conditional Gradient Sliding for Convex Optimization
- (2016) Guanghui Lan et al. SIAM JOURNAL ON OPTIMIZATION
- Convergence Analysis of Alternating Direction Method of Multipliers for a Family of Nonconvex Problems
- (2016) Mingyi Hong et al. SIAM JOURNAL ON OPTIMIZATION
- Scalable Robust Matrix Recovery: Frank--Wolfe Meets Proximal Methods
- (2016) Cun Mu et al. SIAM JOURNAL ON SCIENTIFIC COMPUTING
- A smoothing SQP framework for a class of composite $$L_q$$ L q minimization over polyhedron
- (2015) Ya-Feng Liu et al. MATHEMATICAL PROGRAMMING
- Duality Between Subgradient and Conditional Gradient Methods
- (2015) Francis Bach SIAM JOURNAL ON OPTIMIZATION
- Global Convergence of Splitting Methods for Nonconvex Composite Optimization
- (2015) Guoyin Li et al. SIAM JOURNAL ON OPTIMIZATION
- Complexity analysis of interior point algorithms for non-Lipschitz and nonconvex minimization
- (2014) Wei Bian et al. MATHEMATICAL PROGRAMMING
- Conditional gradient algorithms for norm-regularized smooth convex optimization
- (2014) Zaid Harchaoui et al. MATHEMATICAL PROGRAMMING
- New analysis and results for the Frank–Wolfe method
- (2014) Robert M. Freund et al. MATHEMATICAL PROGRAMMING
- Multi-stage convex relaxation for feature selection
- (2013) Tong Zhang BERNOULLI
- Proximal alternating linearized minimization for nonconvex and nonsmooth problems
- (2013) Jérôme Bolte et al. MATHEMATICAL PROGRAMMING
- First-order methods of smooth convex optimization with inexact oracle
- (2013) Olivier Devolder et al. MATHEMATICAL PROGRAMMING
- Worst-Case Complexity of Smoothing Quadratic Regularization Methods for Non-Lipschitzian Optimization
- (2013) Wei Bian et al. SIAM JOURNAL ON OPTIMIZATION
- Conditional Gradient Algorithmsfor Rank-One Matrix Approximations with a Sparsity Constraint
- (2013) Ronny Luss et al. SIAM REVIEW
- An adaptive cubic regularization algorithm for nonconvex optimization with convex constraints and its function-evaluation complexity
- (2012) C. Cartis et al. IMA JOURNAL OF NUMERICAL ANALYSIS
- Approximate KKT points and a proximity measure for termination
- (2012) Joydeep Dutta et al. JOURNAL OF GLOBAL OPTIMIZATION
- Complexity of unconstrained $$L_2-L_p$$ minimization
- (2012) Xiaojun Chen et al. MATHEMATICAL PROGRAMMING
- Augmented Lagrangian alternating direction method for matrix separation based on low-rank factorization
- (2012) Y. Shen et al. OPTIMIZATION METHODS & SOFTWARE
- Nearly unbiased variable selection under minimax concave penalty
- (2010) Cun-Hui Zhang ANNALS OF STATISTICS
- Adaptive cubic regularisation methods for unconstrained optimization. Part II: worst-case function- and derivative-evaluation complexity
- (2010) Coralia Cartis et al. MATHEMATICAL PROGRAMMING
- Proximal Alternating Minimization and Projection Methods for Nonconvex Problems: An Approach Based on the Kurdyka-Łojasiewicz Inequality
- (2010) Hédy Attouch et al. MATHEMATICS OF OPERATIONS RESEARCH
- On the Complexity of Steepest Descent, Newton's and Regularized Newton's Methods for Nonconvex Unconstrained Optimization Problems
- (2010) C. Cartis et al. SIAM JOURNAL ON OPTIMIZATION
- Characterizations of Łojasiewicz inequalities: Subgradient flows, talweg, convexity
- (2010) Jérôme Bolte et al. TRANSACTIONS OF THE AMERICAN MATHEMATICAL SOCIETY
- A forward–backward splitting algorithm for the minimization of non-smooth convex functionals in Banach space
- (2008) Kristian Bredies INVERSE PROBLEMS
- Enhancing Sparsity by Reweighted ℓ 1 Minimization
- (2008) Emmanuel J. Candès et al. JOURNAL OF FOURIER ANALYSIS AND APPLICATIONS
Add your recorded webinar
Do you already have a recorded webinar? Grow your audience and get more views by easily listing your recording on Peeref.
Upload NowCreate your own webinar
Interested in hosting your own webinar? Check the schedule and propose your idea to the Peeref Content Team.
Create Now