scientific article
From MaRDI portal
Publication:2809807
zbMath1365.90196arXiv1405.4980MaRDI QIDQ2809807
Publication date: 30 May 2016
Full work available at URL: https://arxiv.org/abs/1405.4980
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Analysis of algorithms and problem complexity (68Q25) Convex programming (90C25) Abstract computational complexity for mathematical programming problems (90C60)
Related Items
Fit without fear: remarkable mathematical phenomena of deep learning through the prism of interpolation ⋮ Convergence guarantees for a class of non-convex and non-smooth optimization problems ⋮ Optimal Algorithms for Non-Smooth Distributed Optimization in Networks ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unifying mirror descent and dual averaging ⋮ Semi-discrete optimal transport: hardness, regularization and numerical solution ⋮ Beyond submodularity: a unified framework of randomized set selection with group fairness constraints ⋮ A new generalization of q-Hermite-Hadamard type integral inequalities for p, (p-s) and modified (p-s)-convex functions ⋮ Proximal Splitting Algorithms for Convex Optimization: A Tour of Recent Advances, with New Twists ⋮ Nesterov's Method for Convex Optimization ⋮ Likelihood landscape and maximum likelihood estimation for the discrete orbit recovery model ⋮ Min-Max-Min Optimization with Smooth and Strongly Convex Objectives ⋮ Asynchronous fully-decentralized SGD in the cluster-based model ⋮ Non-smooth setting of stochastic decentralized convex optimization problem over time-varying graphs ⋮ High-dimensional \(M\)-estimation for Byzantine-robust decentralized learning ⋮ Universal Conditional Gradient Sliding for Convex Optimization ⋮ M-IHS: an accelerated randomized preconditioning method avoiding costly matrix decompositions ⋮ Composite optimization with coupling constraints via dual proximal gradient method with applications to asynchronous networks ⋮ Accelerated gradient methods with absolute and relative noise in the gradient ⋮ Reconciling business analytics with graphically initialized subspace clustering for optimal nonlinear pricing ⋮ A unified analysis of stochastic gradient‐free Frank–Wolfe methods ⋮ Persuasion in Networks: Public Signals and Cores ⋮ A framework of convergence analysis of mini-batch stochastic projected gradient methods ⋮ Stochastic mirror descent method for linear ill-posed problems in Banach spaces ⋮ Stochastic composition optimization of functions without Lipschitz continuous gradient ⋮ Convergence rates of gradient methods for convex optimization in the space of measures ⋮ Robust distributed multicategory angle-based classification for massive data ⋮ No-regret algorithms in on-line learning, games and convex optimization ⋮ No-regret dynamics in the Fenchel game: a unified framework for algorithmic convex optimization ⋮ Accelerated methods for weakly-quasi-convex optimization problems ⋮ Tutorial on Amortized Optimization ⋮ Time‐varying β‐model for dynamic directed networks ⋮ Robustifying Markowitz ⋮ Learning Stationary Nash Equilibrium Policies in \(n\)-Player Stochastic Games with Independent Chains ⋮ Stochastic projective splitting ⋮ On maximum a posteriori estimation with Plug \& Play priors and stochastic gradient descent ⋮ Provably efficient reinforcement learning in decentralized general-sum Markov games ⋮ Complexity of optimizing over the integers ⋮ DIMIX: Diminishing Mixing for Sloppy Agents ⋮ Adaptive constraint satisfaction for Markov decision process congestion games: application to transportation networks ⋮ Hessian averaging in stochastic Newton methods achieves superlinear convergence ⋮ Some adaptive first-order methods for variational inequalities with relatively strongly monotone operators and generalized smoothness ⋮ First-order methods for convex optimization ⋮ A Random-Batch Monte Carlo Method for Many-Body Systems with Singular Kernels ⋮ Data-Driven Mirror Descent with Input-Convex Neural Networks ⋮ Robust supervised learning with coordinate gradient descent ⋮ A polynomial time infeasible interior-point arc-search algorithm for convex optimization ⋮ Asymptotic theory in network models with covariates and a growing number of node parameters ⋮ Differentially private inference via noisy optimization ⋮ Towards multi‐agent reinforcement learning‐driven over‐the‐counter market simulations ⋮ On some similarity of finite sets (and what we can say today about certain old problem) ⋮ Gradient descent on infinitely wide neural networks: global convergence and generalization ⋮ High-dimensional functional graphical model structure learning via neighborhood selection approach ⋮ Adaptive Catalyst for Smooth Convex Optimization ⋮ Recent Theoretical Advances in Non-Convex Optimization ⋮ Duality and Stability in Complex Multiagent State-Dependent Network Dynamics ⋮ Asynchronous Schemes for Stochastic and Misspecified Potential Games and Nonconvex Optimization ⋮ Inexact primal–dual gradient projection methods for nonlinear optimization on convex set ⋮ Efficient Search of First-Order Nash Equilibria in Nonconvex-Concave Smooth Min-Max Problems ⋮ An Optimal Algorithm for Decentralized Finite-Sum Optimization ⋮ A Distributed Flexible Delay-Tolerant Proximal Gradient Algorithm ⋮ Unnamed Item ⋮ Solving inverse problems using data-driven models ⋮ Convergence Rates for Deterministic and Stochastic Subgradient Methods without Lipschitz Continuity ⋮ Hessian Barrier Algorithms for Linearly Constrained Optimization Problems ⋮ Unnamed Item ⋮ On the Convergence of Projected-Gradient Methods with Low-Rank Projections for Smooth Convex Minimization over Trace-Norm Balls and Related Problems ⋮ Convergence of the Random Batch Method for Interacting Particles with Disparate Species and Weights ⋮ Unnamed Item ⋮ Unnamed Item ⋮ COCO: a platform for comparing continuous optimizers in a black-box setting ⋮ A dual approach for optimal algorithms in distributed optimization over networks ⋮ Asymptotically Optimal Sequential Design for Rank Aggregation ⋮ Smoothed Variable Sample-Size Accelerated Proximal Methods for Nonsmooth Stochastic Convex Programs ⋮ Optimization by Gradient Boosting ⋮ Heteroskedastic PCA: algorithm, optimality, and applications ⋮ Stochastic matrix-free equilibration ⋮ Variable demand and multi-commodity flow in Markovian network equilibrium ⋮ Replicator dynamics: old and new ⋮ New Hadamard-type inequalities for \(E\)-convex functions involving generalized fractional integrals ⋮ An Accelerated Level-Set Method for Inverse Scattering Problems ⋮ Efficient numerical methods to solve sparse linear equations with application to PageRank ⋮ Graph-Dependent Implicit Regularisation for Distributed Stochastic Subgradient Descent ⋮ On Numerical Estimates of Errors in Solving Convex Optimization Problems ⋮ Random Batch Methods for Classical and Quantum Interacting Particle Systems and Statistical Samplings ⋮ Efficient numerical methods for entropy-linear programming problems ⋮ Bandit online optimization over the permutahedron ⋮ A stochastic subgradient method for distributionally robust non-convex and non-smooth learning ⋮ Stochastic saddle-point optimization for the Wasserstein barycenter problem ⋮ Divergences on symmetric cones and medians ⋮ Nonconvex Low-Rank Tensor Completion from Noisy Data ⋮ Global Linear Convergence of Evolution Strategies on More than Smooth Strongly Convex Functions ⋮ Vaidya's method for convex stochastic optimization problems in small dimension ⋮ How can we identify the sparsity structure pattern of high-dimensional data: an elementary statistical analysis to interpretable machine learning ⋮ The computational asymptotics of Gaussian variational inference and the Laplace approximation ⋮ Exact worst-case convergence rates of the proximal gradient method for composite convex minimization ⋮ Elliptic quasi-variational inequalities under a smallness assumption: uniqueness, differential stability and optimal control ⋮ Numerical methods for the resource allocation problem in a computer network ⋮ Robust statistical learning with Lipschitz and convex loss functions ⋮ A regularization interpretation of the proximal point method for weakly convex functions ⋮ Accelerating incremental gradient optimization with curvature information ⋮ A multiplicative weight updates algorithm for packing and covering semi-infinite linear programs ⋮ Linear convergence of first order methods for non-strongly convex optimization ⋮ The Stochastic Auxiliary Problem Principle in Banach Spaces: Measurability and Convergence ⋮ On the Random Batch Method for Second Order Interacting Particle Systems ⋮ Perturbed Iterate Analysis for Asynchronous Stochastic Optimization ⋮ Adaptive block coordinate DIRECT algorithm ⋮ Implicit regularization in nonconvex statistical estimation: gradient descent converges linearly for phase retrieval, matrix completion, and blind deconvolution ⋮ Optimization based methods for partially observed chaotic systems ⋮ Unnamed Item ⋮ Efficient, certifiably optimal clustering with applications to latent variable graphical models ⋮ Behavior of accelerated gradient methods near critical points of nonconvex functions ⋮ Accelerated gradient boosting ⋮ Robust classification via MOM minimization ⋮ Metamodel construction for sensitivity analysis ⋮ Scale-free online learning ⋮ Mirror descent algorithms for minimizing interacting free energy ⋮ Inexact gradient projection method with relative error tolerance ⋮ A Multiplicative Weights Update Algorithm for Packing and Covering Semi-infinite Linear Programs ⋮ Bregman three-operator splitting methods ⋮ Approachability, regret and calibration: implications and equivalences ⋮ Dimensionality reduction of SDPs through sketching ⋮ Accelerated methods for saddle-point problem ⋮ Random batch methods (RBM) for interacting particle systems ⋮ How Effectively Train Large-Scale Machine Learning Models? ⋮ Improved linear embeddings via Lagrange duality ⋮ Continuation methods for approximate large scale object sequencing ⋮ Convergence of distributed gradient-tracking-based optimization algorithms with random graphs ⋮ Polynomial-time algorithms for submodular Laplacian systems ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Data-driven inverse optimization with imperfect information ⋮ Analysis of biased stochastic gradient descent using sequential semidefinite programs ⋮ Unnamed Item ⋮ Strong convexity of sandwiched entropies and related optimization problems ⋮ Natural gradient for combined loss using wavelets ⋮ Convergence rates for optimised adaptive importance samplers ⋮ Approximate inference for constructing astronomical catalogs from images ⋮ Bounds for the tracking error of first-order online optimization methods ⋮ A new look at the Hardy-Littlewood-Pólya inequality of majorization ⋮ Mass-spring-damper networks for distributed optimization in non-Euclidean spaces ⋮ Distributed Learning with Sparse Communications by Identification ⋮ Bias of homotopic gradient descent for the hinge loss ⋮ A Newton-CG algorithm with complexity guarantees for smooth unconstrained optimization ⋮ Regularisation of neural networks by enforcing Lipschitz continuity ⋮ Nudging the particle filter ⋮ Robust and sparse regression in generalized linear model by stochastic optimization ⋮ Infinite-dimensional gradient-based descent for alpha-divergence minimisation ⋮ A fully polynomial time approximation scheme for the smallest diameter of imprecise points ⋮ Spectral method and regularized MLE are both optimal for top-\(K\) ranking ⋮ Exploiting problem structure in optimization under uncertainty via online convex optimization ⋮ Solving convex min-min problems with smoothness and strong convexity in one group of variables and low dimension in the other ⋮ Making the Last Iterate of SGD Information Theoretically Optimal ⋮ Convex optimization with an interpolation-based projection and its application to deep learning ⋮ Inverse reinforcement learning in contextual MDPs ⋮ Efficient Online Linear Optimization with Approximation Algorithms ⋮ Convergence results of a nested decentralized gradient method for non-strongly convex problems ⋮ Generalized Nesterov's accelerated proximal gradient algorithms with convergence rate of order \(o(1/k^2)\) ⋮ A consensus-based global optimization method for high dimensional machine learning problems ⋮ Intuitionistic-fuzzy goals in zero-sum multi criteria matrix games ⋮ A Finite Time Analysis of Temporal Difference Learning with Linear Function Approximation ⋮ Understanding the acceleration phenomenon via high-resolution differential equations ⋮ Low-Rank Matrix Estimation from Rank-One Projections by Unlifted Convex Optimization ⋮ Duality gap estimates for weak Chebyshev greedy algorithms in Banach spaces ⋮ A stochastic gradient algorithm with momentum terms for optimal control problems governed by a convection-diffusion equation with random diffusivity ⋮ Tensor-Structured Sketching for Constrained Least Squares ⋮ From inexact optimization to learning via gradient concentration ⋮ Proximal Gradient Methods with Adaptive Subspace Sampling ⋮ On the convergence of exact distributed generalisation and acceleration algorithm for convex optimisation ⋮ Accelerated proximal envelopes: application to componentwise methods ⋮ On the computational efficiency of catalyst accelerated coordinate descent ⋮ Fast Core Pricing for Rich Advertising Auctions
