Pages that link to "Item:Q359630"
From MaRDI portal
The following pages link to Gradient methods for minimizing composite functions (Q359630):
Displaying 50 items.
- On a scaled symmetric Dai-Liao-type scheme for constrained system of nonlinear equations with applications (Q6150644) (← links)
- Efficiency of higher-order algorithms for minimizing composite functions (Q6155068) (← links)
- Proximal quasi-Newton method for composite optimization over the Stiefel manifold (Q6159020) (← links)
- A refined inertial DC algorithm for DC programming (Q6159465) (← links)
- An extrapolated proximal iteratively reweighted method for nonconvex composite optimization problems (Q6164017) (← links)
- A reduced half thresholding algorithm (Q6164988) (← links)
- Faster first-order primal-dual methods for linear programming using restarts and sharpness (Q6165583) (← links)
- Principled analyses and design of first-order methods with inexact proximal operators (Q6165584) (← links)
- Accelerating inexact successive quadratic approximation for regularized optimization through manifold identification (Q6165598) (← links)
- Average curvature FISTA for nonconvex smooth composite optimization problems (Q6166656) (← links)
- Convergence of an asynchronous block-coordinate forward-backward algorithm for convex composite optimization (Q6166657) (← links)
- First-order methods for convex optimization (Q6169988) (← links)
- Data-Driven Mirror Descent with Input-Convex Neural Networks (Q6171691) (← links)
- Minimizing oracle-structured composite functions (Q6173766) (← links)
- A variable metric and Nesterov extrapolated proximal DCA with backtracking for a composite DC program (Q6175368) (← links)
- A Newton-type proximal gradient method for nonlinear multi-objective optimization problems (Q6175566) (← links)
- Optimal Transport Approximation of 2-Dimensional Measures (Q6175992) (← links)
- An inexact primal-dual smoothing framework for large-scale non-bilinear saddle point problems (Q6182323) (← links)
- Proximal gradient method with extrapolation and line search for a class of non-convex and non-smooth problems (Q6182324) (← links)
- Homogenization with the quasistatic Tresca friction law: qualitative and quantitative results (Q6183900) (← links)
- An \(\ell_{2,0}\)-norm constrained matrix optimization via extended discrete first-order algorithms (Q6187383) (← links)
- Supervised homogeneity fusion: a combinatorial approach (Q6192329) (← links)
- Adaptive proximal SGD based on new estimating sequences for sparser ERM (Q6196471) (← links)
- A semismooth Newton stochastic proximal point algorithm with variance reduction (Q6490309) (← links)
- Accelerated gradient methods for sparse statistical learning with nonconvex penalties (Q6494394) (← links)
- SPIRAL: a superlinearly convergent incremental proximal algorithm for nonconvex finite sum minimization (Q6498409) (← links)
- Accelerated forward–backward algorithms for structured monotone inclusions (Q6498412) (← links)
- 1-D CNNs with lock-free asynchronous adaptive stochastic gradient descent algorithm for classification of astronomical spectra (Q6536411) (← links)
- First-order penalty methods for bilevel optimization (Q6551212) (← links)
- A simple and efficient convex optimization based bound-preserving high order accurate limiter for Cahn-Hilliard-Navier-Stokes system (Q6551217) (← links)
- A dual-primal finite element tearing and interconnecting method for nonlinear variational inequalities utilizing linear local problems (Q6554015) (← links)
- A subgradient method with constant step-size for \(\ell_1\)-composite optimization (Q6564822) (← links)
- An inertial projection and contraction algorithm for pseudomonotone variational inequalities without Lipschitz continuity (Q6565284) (← links)
- HOSVD-TMPE: an extrapolation method for multidimensional sequences (Q6566101) (← links)
- Tikhonov regularization as a nonparametric method for uncertainty quantification in aggregate data problems (Q6572168) (← links)
- Scalable Frank-Wolfe on generalized self-concordant functions via simple steps (Q6573011) (← links)
- Subgradient regularized multivariate convex regression at scale (Q6573015) (← links)
- Two classes of spectral three-term derivative-free method for solving nonlinear equations with application (Q6582395) (← links)
- Convergence analysis of stochastic higher-order majorization–minimization algorithms (Q6586916) (← links)
- Complexity-optimal and parameter-free first-order methods for finding stationary points of composite optimization problems (Q6601206) (← links)
- A survey of numerical algorithms that can solve the Lasso problems (Q6602016) (← links)
- Fast convergence rate of values with strong convergence of trajectories via inertial dynamics with Tikhonov regularization terms and asymptotically vanishing damping (Q6615601) (← links)
- A Multicategory Kernel Distance Weighted Discrimination Method for Multiclass Classification (Q6621651) (← links)
- Parameter-free FISTA by adaptive restart and backtracking (Q6622751) (← links)
- A novel robust estimation for high-dimensional precision matrices (Q6629954) (← links)
- Additive Schwarz methods for convex optimization -- convergence theory and acceleration (Q6630175) (← links)
- High-Dimensional Cost-constrained Regression Via Nonconvex Optimization (Q6631045) (← links)
- Fast and Exact Leave-One-Out Analysis of Large-Margin Classifiers (Q6631070) (← links)
- Stochastic variance-reduced majorization-minimization algorithms (Q6633042) (← links)
- Complementary composite minimization, small gradients in general norms, and applications (Q6634528) (← links)