First-order methods in optimization
From MaRDI portal
Recommendations
Cited in
(only showing first 100 items - show all)- Convergence rate analysis for the higher order power method in best rank one approximations of tensors
- A simplified view of first order methods for optimization
- Stochastic gradient descent with Polyak's learning rate
- Preconditioned accelerated gradient descent methods for locally Lipschitz smooth objectives with applications to the solution of nonlinear PDEs
- Strongly convergent algorithms by using new adaptive regularization parameter for equilibrium problems
- Point process estimation with Mirror Prox algorithms
- On the interplay between acceleration and identification for the proximal gradient algorithm
- A golden ratio primal-dual algorithm for structured convex optimization
- Inexact proximal memoryless quasi-Newton methods based on the Broyden family for minimizing composite functions
- Stochastic proximal gradient methods for nonconvex problems in Hilbert spaces
- Conditional gradient method for multiobjective optimization
- Globalized inexact proximal Newton-type methods for nonconvex composite functions
- Bounds for the tracking error of first-order online optimization methods
- Inexact derivative-free optimization for bilevel learning
- Robust PCA via regularized \textsc{Reaper} with a matrix-free proximal algorithm
- Accelerated Bregman proximal gradient methods for relatively smooth convex optimization
- A Laplacian approach to _1-norm minimization
- A block inertial Bregman proximal algorithm for nonsmooth nonconvex problems with application to symmetric nonnegative matrix tri-factorization
- \(\ell_{2,0}\)-norm based selection and estimation for multivariate generalized linear models
- A first-order image restoration model that promotes image contrast preservation
- On inversion-free mapping and distortion minimization
- On functions determined by dense sets
- A parallel splitting ALM-based algorithm for separable convex programming
- Optimal portfolio selections via \(\ell_{1, 2}\)-norm regularization
- Solving a class of nonsmooth resource allocation problems with directed graphs through distributed Lipschitz continuous multi-proximal algorithms
- A subgradient proximal method for solving a class of monotone multivalued variational inequality problems
- A hybrid semismooth quasi-Newton method for nonsmooth optimal control with PDEs
- Weak and strong convergence Bregman extragradient schemes for solving pseudo-monotone and non-Lipschitz variational inequalities
- Finding best approximation pairs for two intersections of closed convex sets
- Variational analysis perspective on linear convergence of some first order methods for nonsmooth convex optimization problems
- Smoothing Newton method for \(\ell^0\)-\(\ell^2\) regularized linear inverse problem
- Two-step blind deconvolution of UPC-a barcode images
- Convergence of a distributed method for minimizing sum of convex functions with fixed point constraints
- Frame soft shrinkage operators are proximity operators
- Bregman subgradient extragradient method with monotone self-adjustment stepsize for solving pseudo-monotone variational inequalities and fixed point problems
- On stochastic mirror descent with interacting particles: convergence properties and variance reduction
- Strong subdifferentials: theory and applications in nonconvex optimization
- Hybrid inertial contraction algorithms for solving variational inequalities with fixed point constraints in Hilbert spaces
- Proximal gradient method for nonconvex and nonsmooth optimization on Hadamard manifolds
- Dualize, split, randomize: toward fast nonsmooth optimization algorithms
- Cyclic coordinate descent in the Hölder smooth setting
- The regularized feasible directions method for nonconvex optimization
- Inertial proximal incremental aggregated gradient method with linear convergence guarantees
- Convergence theorems for solving a system of pseudomonotone variational inequalities using Bregman distance in Banach spaces
- Curiosities and counterexamples in smooth convex optimization
- A dual Bregman proximal gradient method for relatively-strongly convex optimization
- On the nonexpansive operators based on arbitrary metric: a degenerate analysis
- Convergence properties of monotone and nonmonotone proximal gradient methods revisited
- A semismooth Newton-based augmented Lagrangian algorithm for density matrix least squares problems
- An adaptive Polyak heavy-ball method
- Tensor completion via a generalized transformed tensor t-product decomposition without t-SVD
- A stochastic Nesterov's smoothing accelerated method for general nonsmooth constrained stochastic composite convex optimization
- An inexact ADMM with proximal-indefinite term and larger stepsize
- Network manipulation algorithm based on inexact alternating minimization
- Cartoon-texture evolution for two-region image segmentation
- Sparse regularization via bidualization
- Strong convergence of inertial projection and contraction methods for pseudomonotone variational inequalities with applications to optimal control problems
- On strongly quasiconvex functions: existence results and proximal point algorithms
- Proximal operator and optimality conditions for ramp loss SVM
- A fixed-point proximity algorithm for recovering low-rank components from incomplete observation data with application to motion capture data refinement
- An inexact successive quadratic approximation method for a class of difference-of-convex optimization problems
- Convergence results of iterative algorithms for the sum of two monotone operators in reflexive Banach spaces.
- Block-coordinate and incremental aggregated proximal gradient methods for nonsmooth nonconvex problems
- An accelerated coordinate gradient descent algorithm for non-separable composite optimization
- Proximal point algorithms for quasiconvex pseudomonotone equilibrium problems
- Second order semi-smooth proximal Newton methods in Hilbert spaces
- On the branch and bound algorithm for the extended trust-region subproblem
- New Bregman projection methods for solving pseudo-monotone variational inequality problem
- The DTC (difference of tangentially convex functions) programming: optimality conditions
- An inexact proximal DC algorithm with sieving strategy for rank constrained least squares semidefinite programming
- A geometric proximal gradient method for sparse least squares regression with probabilistic simplex constraint
- Riemannian proximal gradient methods
- Scaled relative graphs: nonexpansive operators via 2D Euclidean geometry
- Fast multidimensional completion and principal component analysis methods via the cosine product
- Accelerated inexact composite gradient methods for nonconvex spectral optimization problems
- An accelerated common fixed point algorithm for a countable family of \(G\)-nonexpansive mappings with applications to image recovery
- Convergence rates of a dual gradient method for constrained linear ill-posed problems
- New self-adaptive methods with double inertial steps for solving splitting monotone variational inclusion problems with applications
- A regularized alternating least-squares method for minimizing a sum of squared Euclidean norms with rank constraint
- A simple method for convex optimization in the oracle model
- Non-convex split Feasibility problems: models, algorithms and theory
- Inertial self-adaptive Bregman projection method for finite family of variational inequality problems in reflexive Banach spaces
- The springback penalty for robust signal recovery
- A strong convergence algorithm for solving pseudomonotone variational inequalities with a single projection
- A regularization interpretation of the proximal point method for weakly convex functions
- An efficient adaptive accelerated inexact proximal point method for solving linearly constrained nonconvex composite problems
- Primal-dual fixed point algorithm based on adapted metric method for solving convex minimization problem with application
- Consensus optimization of total variation-based reverse time migration
- Convergence of slice-based block coordinate descent algorithm for convolutional sparse coding
- Finding second-order stationary points in constrained minimization: a feasible direction approach
- Discrete processes and their continuous limits
- Global complexity analysis of inexact successive quadratic approximation methods for regularized optimization under mild assumptions
- Applying FISTA to optimization problems (with or) without minimizers
- A proximal gradient method for control problems with non-smooth and non-convex control cost
- Computational inverse problems for partial differential equations. Abstracts from the workshop held December 6--12, 2020 (hybrid meeting)
- On the weak stationarity conditions for mathematical programs with cardinality constraints: a unified approach
- Convolutional proximal neural networks and plug-and-play algorithms
- On starting and stopping criteria for nested primal-dual iterations
- Smoothing algorithms for computing the projection onto a Minkowski sum of convex sets
- Accelerated proximal incremental algorithm schemes for non-strongly convex functions
This page was built for publication: First-order methods in optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4599293)
