scientific article; zbMATH DE number 3850830
From MaRDI portal
Publication:3320132
Recommendations
- Rate of convergence of the method of feasible directions, not necessarily using the direction of steepest descent
- A descent method with the use uf duality for the solution of a convex programming problem in a Hilbert space
- scientific article; zbMATH DE number 4057292
- scientific article; zbMATH DE number 3847229
- scientific article; zbMATH DE number 2102650
Cited in
(only showing first 100 items - show all)- Accelerated gradient boosting
- Robust least square semidefinite programming with applications
- Performance of first-order methods for smooth convex minimization: a novel approach
- Approximation accuracy, gradient methods, and error bound for structured convex optimization
- Random algorithms for convex minimization problems
- Regularized estimation and testing for high-dimensional multi-block vector-autoregressive models
- iPiasco: inertial proximal algorithm for strongly convex optimization
- Domain adaptation and sample bias correction theory and algorithm for regression
- Solving structured nonsmooth convex optimization with complexity \(\mathcal {O}(\varepsilon ^{-1/2})\)
- Operator splittings, Bregman methods and frame shrinkage in image processing
- Efficient valuation of SCR via a neural network approach
- A convergent least-squares regularized blind deconvolution approach
- A differential variational approach for handling fluid-solid interaction problems via smoothed particle hydrodynamics
- Smooth strongly convex interpolation and exact worst-case performance of first-order methods
- Optimal subgradient methods: computational properties for large-scale linear inverse problems
- Clustering and feature selection using sparse principal component analysis
- Deep Learning--Based Dictionary Learning and Tomographic Image Reconstruction
- Image restoration with mixed or unknown noises
- On the second-order asymptotical regularization of linear ill-posed inverse problems
- Accelerated first-order primal-dual proximal methods for linearly constrained composite convex programming
- Exact worst-case performance of first-order methods for composite convex optimization
- A projected gradient and constraint linearization method for nonlinear model predictive control
- Certification aspects of the fast gradient method for solving the dual of parametric convex programs
- Projected subgradient minimization versus superiorization
- On the proximal gradient algorithm with alternated inertia
- Augmented Lagrangian algorithms for linear programming
- Sparse PCA: convex relaxations, algorithms and applications
- An efficient primal-dual method for the obstacle problem
- Accelerated sparse recovery via gradient descent with nonlinear conjugate gradient momentum
- Phase recovery, MaxCut and complex semidefinite programming
- A remark on accelerated block coordinate descent for computing the proximity operators of a sum of convex functions
- An Accelerated Level-Set Method for Inverse Scattering Problems
- Proximal splitting methods in signal processing
- Accelerated Bregman method for linearly constrained \(\ell _1-\ell _2\) minimization
- Stochastic relaxed inertial forward-backward-forward splitting for monotone inclusions in Hilbert spaces
- Minimax and Minimax Projection Designs Using Clustering
- A review of nonlinear FFT-based computational homogenization methods
- Accelerated, parallel, and proximal coordinate descent
- Reference and command governors for systems with constraints: A survey on theory and applications
- Adaptive restart for accelerated gradient schemes
- Proximal Methods for Sparse Optimal Scoring and Discriminant Analysis
- Backtracking strategies for accelerated descent methods with smooth composite objectives
- Inertial forward-backward algorithms with perturbations: application to Tikhonov regularization
- An optimal subgradient algorithm with subspace search for costly convex optimization problems
- Dual subgradient algorithms for large-scale nonsmooth learning problems
- Social welfare and profit maximization from revealed preferences
- A relaxed-projection splitting algorithm for variational inequalities in Hilbert spaces
- A reweighted \(\ell^2\) method for image restoration with Poisson and mixed Poisson-Gaussian noise
- Linear coupling: an ultimate unification of gradient and mirror descent
- Fast Krasnosel’skiĭ–Mann Algorithm with a Convergence Rate of the Fixed Point Iteration of \(\boldsymbol{{ o} \left(\frac{1}{{ k}} \right)}\)
- A linear-time algorithm for trust region problems
- A smoothing SQP framework for a class of composite \(L_q\) minimization over polyhedron
- OSGA: a fast subgradient algorithm with optimal complexity
- Optimal subgradient algorithms for large-scale convex optimization in simple domains
- IMRO: A proximal quasi-Newton method for solving \(\ell_1\)-regularized least squares problems
- Sparse regression with multi-type regularized feature modeling
- Optimization on Spheres: Models and Proximal Algorithms with Computational Performance Comparisons
- Optimized first-order methods for smooth convex minimization
- First-order methods for convex optimization
- New results on subgradient methods for strongly convex optimization problems with a unified analysis
- Accelerated first-order methods for large-scale convex optimization: nearly optimal complexity under strong convexity
- Fast convex optimization via inertial dynamics with Hessian driven damping
- A neural network approach to efficient valuation of large portfolios of variable annuities
- Metric selection in fast dual forward-backward splitting
- Information-based complexity of linear operator equations
- Resource allocation in communication networks with large number of users: the dual stochastic gradient method
- scientific article; zbMATH DE number 4079168 (Why is no real title available?)
- Efficient first-order methods for convex minimization: a constructive approach
- Stochastic compositional gradient descent: algorithms for minimizing compositions of expected-value functions
- Proximal algorithms in statistics and machine learning
- Diffusion tensor imaging with deterministic error bounds
- Comparative study of RPSALG algorithm for convex semi-infinite programming
- An efficient inexact ABCD method for least squares semidefinite programming
- Optimization in high dimensions via accelerated, parallel, and proximal coordinate descent
- Algorithm 996
- Distributed adaptive dynamic programming for data-driven optimal control
- A stable method solving the total variation dictionary model with \(L^\infty\) constraints
- ASD+M: automatic parameter tuning in stochastic optimization and on-line learning
- scientific article; zbMATH DE number 3516928 (Why is no real title available?)
- Fast convex optimization via inertial dynamics combining viscous and Hessian-driven damping with time rescaling
- Linear convergence of proximal gradient algorithm with extrapolation for a class of nonconvex nonsmooth minimization problems
- Convergence of the augmented decomposition algorithm
- A multiplicative weights update algorithm for packing and covering semi-infinite linear programs
- Limited-memory common-directions method for large-scale optimization: convergence, parallelization, and distributed optimization
- Large-scale eigenvector approximation via Hilbert space embedding Nyström
- First-order optimization algorithms via inertial systems with Hessian driven damping
- Convergence rate analysis of proximal gradient methods with applications to composite minimization problems
- Stochastic heavy ball
- Stochastic accelerated alternating direction method of multipliers with importance sampling
- A generic online acceleration scheme for optimization algorithms via relaxation and inertia
- A highly efficient semismooth Newton augmented Lagrangian method for solving lasso problems
- On the convergence of a class of inertial dynamical systems with Tikhonov regularization
- Convergence rates of inertial forward-backward algorithms
- Asymptotic stabilization of inertial gradient dynamics with time-dependent viscosity
- A linear-time algorithm for the trust region subproblem based on hidden convexity
- The Differential Inclusion Modeling FISTA Algorithm and Optimality of Convergence Rate in the Case b $\leq3$
- Accelerated stochastic variance reduction for a class of convex optimization problems
- Alternating direction based method for optimal control problem constrained by Stokes equation
- Accelerated differential inclusion for convex optimization
- Harder, Better, Faster, Stronger Convergence Rates for Least-Squares Regression
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3320132)
