scientific article; zbMATH DE number 3850830

zbMATH Open0535.90071MaRDI QIDQ3320132FDOQ3320132

Publication date: 1983

Title of this publication is not available (Why is that?)

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

estimation convergence rate constrained minimization global Lipschitz condition differentiable objective function convex programming in Hilbert space

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Convex programming (90C25) Methods of successive quadratic programming type (90C55) Programming in abstract spaces (90C48) Inner product spaces and their generalizations, Hilbert spaces (46C99)

Cited In (only showing first 100 items - show all)

Domain adaptation and sample bias correction theory and algorithm for regression
On the proximal gradient algorithm with alternated inertia
A reweighted \(\ell^2\) method for image restoration with Poisson and mixed Poisson-Gaussian noise
ASD+M: automatic parameter tuning in stochastic optimization and on-line learning
Optimal subgradient methods: computational properties for large-scale linear inverse problems
Augmented Lagrangian algorithms for linear programming
Sparse PCA: convex relaxations, algorithms and applications
Linear coupling: an ultimate unification of gradient and mirror descent
Comparative study of RPSALG algorithm for convex semi-infinite programming
Approximation accuracy, gradient methods, and error bound for structured convex optimization
An efficient primal-dual method for the obstacle problem
A review of nonlinear FFT-based computational homogenization methods
Reference and command governors for systems with constraints: A survey on theory and applications
Dual subgradient algorithms for large-scale nonsmooth learning problems
Proximal algorithms in statistics and machine learning
Projected subgradient minimization versus superiorization
A remark on accelerated block coordinate descent for computing the proximity operators of a sum of convex functions
Operator splittings, Bregman methods and frame shrinkage in image processing
A differential variational approach for handling fluid-solid interaction problems via smoothed particle hydrodynamics
Certification aspects of the fast gradient method for solving the dual of parametric convex programs
Accelerated sparse recovery via gradient descent with nonlinear conjugate gradient momentum
Inertial forward-backward algorithms with perturbations: application to Tikhonov regularization
First-order methods for convex optimization
Adaptive restart for accelerated gradient schemes
Fast Krasnosel’skiĭ–Mann Algorithm with a Convergence Rate of the Fixed Point Iteration of \(\boldsymbol{{ o} \left(\frac{1}{{ k}} \right)}\)
Optimization on Spheres: Models and Proximal Algorithms with Computational Performance Comparisons
Proximal splitting methods in signal processing
A convergent least-squares regularized blind deconvolution approach
Sparse regression with multi-type regularized feature modeling
Diffusion tensor imaging with deterministic error bounds
Regularized estimation and testing for high-dimensional multi-block vector-autoregressive models
Deep Learning--Based Dictionary Learning and Tomographic Image Reconstruction
Accelerated gradient boosting
Image restoration with mixed or unknown noises
Exact worst-case performance of first-order methods for composite convex optimization
Accelerated first-order primal-dual proximal methods for linearly constrained composite convex programming
Backtracking strategies for accelerated descent methods with smooth composite objectives
A relaxed-projection splitting algorithm for variational inequalities in Hilbert spaces
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
A neural network approach to efficient valuation of large portfolios of variable annuities
An efficient inexact ABCD method for least squares semidefinite programming
Accelerated, parallel, and proximal coordinate descent
Title not available (Why is that?)
Title not available (Why is that?)
Optimized first-order methods for smooth convex minimization
New results on subgradient methods for strongly convex optimization problems with a unified analysis
Efficient first-order methods for convex minimization: a constructive approach
Accelerated first-order methods for large-scale convex optimization: nearly optimal complexity under strong convexity
Smooth strongly convex interpolation and exact worst-case performance of first-order methods
Fast convex optimization via inertial dynamics with Hessian driven damping
Random algorithms for convex minimization problems
Algorithm 996
Minimax and Minimax Projection Designs Using Clustering
A stable method solving the total variation dictionary model with \(L^\infty\) constraints
Optimization in high dimensions via accelerated, parallel, and proximal coordinate descent
Efficient valuation of SCR via a neural network approach
Stochastic relaxed inertial forward-backward-forward splitting for monotone inclusions in Hilbert spaces
Optimal subgradient algorithms for large-scale convex optimization in simple domains
Robust least square semidefinite programming with applications
Solving structured nonsmooth convex optimization with complexity \(\mathcal {O}(\varepsilon ^{-1/2})\)
Clustering and feature selection using sparse principal component analysis
iPiasco: inertial proximal algorithm for strongly convex optimization
A projected gradient and constraint linearization method for nonlinear model predictive control
Proximal Methods for Sparse Optimal Scoring and Discriminant Analysis
Distributed adaptive dynamic programming for data-driven optimal control
Information-based complexity of linear operator equations
On the second-order asymptotical regularization of linear ill-posed inverse problems
Social welfare and profit maximization from revealed preferences
Accelerated Bregman method for linearly constrained \(\ell _1-\ell _2\) minimization
Metric selection in fast dual forward-backward splitting
An optimal subgradient algorithm with subspace search for costly convex optimization problems
Stochastic compositional gradient descent: algorithms for minimizing compositions of expected-value functions
Performance of first-order methods for smooth convex minimization: a novel approach
Phase recovery, MaxCut and complex semidefinite programming
IMRO: A proximal quasi-Newton method for solving \(\ell_1\)-regularized least squares problems
An Accelerated Level-Set Method for Inverse Scattering Problems
Resource allocation in communication networks with large number of users: the dual stochastic gradient method
Numerical computations of split Bregman method for fourth order total variation flow
Nesterov-aided stochastic gradient methods using Laplace approximation for Bayesian design optimization
A new class of accelerated regularization methods, with application to bioluminescence tomography
On dissipative symplectic integration with applications to gradient-based optimization
Analysis of a heuristic rule for the IRGNM in Banach spaces with convex regularization terms
Ensemble Kalman inversion: a derivative-free technique for machine learning tasks
A new Kaczmarz-type method and its acceleration for nonlinear ill-posed problems
Title not available (Why is that?)
Adaptive FISTA for Nonconvex Optimization
Convergence rate of a relaxed inertial proximal algorithm for convex minimization
Quantum entropic regularization of matrix-valued optimal transport
Two New Inertial Algorithms for Solving Variational Inequalities in Reflexive Banach Spaces
Title not available (Why is that?)
Relaxed inertial Tseng extragradient method for variational inequality and fixed point problems
Error bound of critical points and KL property of exponent 1/2 for squared F-norm regularized factorization
Inertial iterative algorithms for common solution of variational inequality and system of variational inequalities problems
Accelerated information gradient flow
Convergence of relaxed inertial subgradient extragradient methods for quasimonotone variational inequality problems
EGC: entropy-based gradient compression for distributed deep learning
\(\mathrm{B}\)-subdifferentials of the projection onto the matrix simplex
Variational inequality over the set of common solutions of a system of bilevel variational inequality problem with applications

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)