Pages that link to "Item:Q1676921"

The following pages link to A globally convergent algorithm for nonconvex optimization based on block coordinate update (Q1676921):

Displaying 30 items.

• A block coordinate variable metric forward-backward algorithm (Q727391) (← links)
• Local convergence of the heavy-ball method and iPiano for non-convex optimization (Q1637355) (← links)
• Algorithm for overcoming the curse of dimensionality for time-dependent non-convex Hamilton-Jacobi equations arising from optimal control and differential games problems (Q1691386) (← links)
• Asynchronous parallel primal-dual block coordinate update methods for affinely constrained convex programs (Q1734768) (← links)
• An inexact PAM method for computing Wasserstein barycenter with unknown supports (Q1983867) (← links)
• Gradient convergence of deep learning-based numerical methods for BSDEs (Q2044106) (← links)
• On complexity and convergence of high-order coordinate descent algorithms for smooth nonconvex box-constrained minimization (Q2089862) (← links)
• Block-coordinate and incremental aggregated proximal gradient methods for nonsmooth nonconvex problems (Q2133414) (← links)
• Penalized quasi-likelihood estimation of generalized Pareto regression -- consistent identification of risk factors for extreme losses (Q2138617) (← links)
• A primal-dual algorithm for nonnegative \(N\)-th order CP tensor decomposition: application to fluorescence spectroscopy data analysis (Q2146528) (← links)
• Inertial alternating direction method of multipliers for non-convex non-smooth optimization (Q2162531) (← links)
• Primal-dual block-proximal splitting for a class of non-convex problems (Q2218923) (← links)
• An augmented Lagrangian proximal alternating method for sparse discrete optimization problems (Q2299205) (← links)
• Provable accelerated gradient method for nonconvex low rank optimization (Q2303662) (← links)
• Two fast vector-wise update algorithms for orthogonal nonnegative matrix factorization with sparsity constraint (Q2309252) (← links)
• Proximal gradient method for huberized support vector machine (Q2337512) (← links)
• CUSTOM: a calibration region recovery approach for highly subsampled dynamic parallel magnetic resonance imaging (Q2360837) (← links)
• On the convergence of asynchronous parallel iteration with unbounded delays (Q2422607) (← links)
• Misspecified nonconvex statistical optimization for sparse phase retrieval (Q2425184) (← links)
• A two-level distributed algorithm for nonconvex constrained optimization (Q2696920) (← links)
• Block Stochastic Gradient Iteration for Convex and Nonconvex Optimization (Q2945126) (← links)
• Inertial Proximal Alternating Linearized Minimization (iPALM) for Nonconvex and Nonsmooth Problems (Q3179622) (← links)
• Scalable subspace methods for derivative-free nonlinear least-squares optimization (Q6038650) (← links)
• A proximal alternating minimization algorithm for the largest C-eigenvalue of piezoelectric-type tensors (Q6064027) (← links)
• Correntropy based model predictive controller with multi-constraints for robust path trajectory tracking of self-driving vehicle (Q6113883) (← links)
• Binned multinomial logistic regression for integrative cell-type annotation (Q6138653) (← links)
• Quaternion-based color image completion via logarithmic approximation (Q6154478) (← links)
• Local linear convergence of proximal coordinate descent algorithm (Q6181368) (← links)
• Proximal gradient method with extrapolation and line search for a class of non-convex and non-smooth problems (Q6182324) (← links)
• Decomposition methods for global solution of mixed-integer linear programs (Q6490313) (← links)