Pages that link to "Item:Q4599293"

The following pages link to First-Order Methods in Optimization (Q4599293):

Displaying 50 items.

• Proximal Methods for Sparse Optimal Scoring and Discriminant Analysis (Q97534) (← links)
• Evasive path planning under surveillance uncertainty (Q778086) (← links)
• Parseval proximal neural networks (Q785901) (← links)
• Off-diagonal symmetric nonnegative matrix factorization (Q820738) (← links)
• Nonsmoothness in machine learning: specific structure, proximal identification, and applications (Q829492) (← links)
• Convergence rate analysis for the higher order power method in best rank one approximations of tensors (Q1616037) (← links)
• A simplified view of first order methods for optimization (Q1650767) (← links)
• Stochastic gradient descent with Polyak's learning rate (Q1983178) (← links)
• Preconditioned accelerated gradient descent methods for locally Lipschitz smooth objectives with applications to the solution of nonlinear PDEs (Q1983570) (← links)
• Strongly convergent algorithms by using new adaptive regularization parameter for equilibrium problems (Q1987449) (← links)
• Point process estimation with Mirror Prox algorithms (Q2019904) (← links)
• On the interplay between acceleration and identification for the proximal gradient algorithm (Q2023654) (← links)
• A golden ratio primal-dual algorithm for structured convex optimization (Q2025858) (← links)
• Inexact proximal memoryless quasi-Newton methods based on the Broyden family for minimizing composite functions (Q2028458) (← links)
• Stochastic proximal gradient methods for nonconvex problems in Hilbert spaces (Q2028468) (← links)
• Conditional gradient method for multiobjective optimization (Q2028470) (← links)
• Globalized inexact proximal Newton-type methods for nonconvex composite functions (Q2028488) (← links)
• Bounds for the tracking error of first-order online optimization methods (Q2032000) (← links)
• Inexact derivative-free optimization for bilevel learning (Q2036198) (← links)
• Robust PCA via regularized \textsc{Reaper} with a matrix-free proximal algorithm (Q2036201) (← links)
• Accelerated Bregman proximal gradient methods for relatively smooth convex optimization (Q2044481) (← links)
• A Laplacian approach to \(\ell_1\)-norm minimization (Q2044482) (← links)
• A block inertial Bregman proximal algorithm for nonsmooth nonconvex problems with application to symmetric nonnegative matrix tri-factorization (Q2046565) (← links)
• \(\ell_{2,0}\)-norm based selection and estimation for multivariate generalized linear models (Q2048127) (← links)
• A first-order image restoration model that promotes image contrast preservation (Q2051048) (← links)
• On inversion-free mapping and distortion minimization (Q2051139) (← links)
• On functions determined by dense sets (Q2054580) (← links)
• A parallel splitting ALM-based algorithm for separable convex programming (Q2057225) (← links)
• Optimal portfolio selections via \(\ell_{1, 2}\)-norm regularization (Q2057226) (← links)
• Solving a class of nonsmooth resource allocation problems with directed graphs through distributed Lipschitz continuous multi-proximal algorithms (Q2063835) (← links)
• A subgradient proximal method for solving a class of monotone multivalued variational inequality problems (Q2066208) (← links)
• A hybrid semismooth quasi-Newton method for nonsmooth optimal control with PDEs (Q2069115) (← links)
• Weak and strong convergence Bregman extragradient schemes for solving pseudo-monotone and non-Lipschitz variational inequalities (Q2069529) (← links)
• Finding best approximation pairs for two intersections of closed convex sets (Q2070342) (← links)
• Variational analysis perspective on linear convergence of some first order methods for nonsmooth convex optimization problems (Q2070400) (← links)
• Smoothing Newton method for \(\ell^0\)-\(\ell^2\) regularized linear inverse problem (Q2072164) (← links)
• Two-step blind deconvolution of UPC-a barcode images (Q2072573) (← links)
• Convergence of a distributed method for minimizing sum of convex functions with fixed point constraints (Q2073009) (← links)
• Frame soft shrinkage operators are proximity operators (Q2075005) (← links)
• Bregman subgradient extragradient method with monotone self-adjustment stepsize for solving pseudo-monotone variational inequalities and fixed point problems (Q2076350) (← links)
• On stochastic mirror descent with interacting particles: convergence properties and variance reduction (Q2077867) (← links)
• Strong subdifferentials: theory and applications in nonconvex optimization (Q2079689) (← links)
• Hybrid inertial contraction algorithms for solving variational inequalities with fixed point constraints in Hilbert spaces (Q2080333) (← links)
• Proximal gradient method for nonconvex and nonsmooth optimization on Hadamard manifolds (Q2080822) (← links)
• Dualize, split, randomize: toward fast nonsmooth optimization algorithms (Q2082232) (← links)
• Cyclic coordinate descent in the Hölder smooth setting (Q2084003) (← links)
• The regularized feasible directions method for nonconvex optimization (Q2084025) (← links)
• Inertial proximal incremental aggregated gradient method with linear convergence guarantees (Q2084299) (← links)
• Convergence theorems for solving a system of pseudomonotone variational inequalities using Bregman distance in Banach spaces (Q2087725) (← links)
• Curiosities and counterexamples in smooth convex optimization (Q2089782) (← links)