First-Order Methods in Optimization
From MaRDI portal
Publication:4599293
DOI10.1137/1.9781611974997zbMath1384.65033OpenAlexW2763081248MaRDI QIDQ4599293
Publication date: 28 December 2017
Full work available at URL: https://doi.org/10.1137/1.9781611974997
convergencetextbookalternating minimizationproximal gradient methodsmirror descent methodprimal and dual subgradient methods
Numerical mathematical programming methods (65K05) Convex programming (90C25) Research exposition (monographs, survey articles) pertaining to numerical analysis (65-02) Methods of reduced gradient type (90C52)
Related Items
Differentially private distributed logistic regression with the objective function perturbation, Survey Descent: A Multipoint Generalization of Gradient Descent for Nonsmooth Optimization, A Unified Analysis of Descent Sequences in Weakly Convex Optimization, Including Convergence Rates for Bundle Methods, A Two-Timescale Stochastic Algorithm Framework for Bilevel Optimization: Complexity Analysis and Application to Actor-Critic, A rank-two relaxed parallel splitting version of the augmented Lagrangian method with step size in (0,2) for separable convex programming, Fast Algorithms for LS and LAD-Collaborative Regression, On the Properties of Convex Functions over Open Sets, Linear convergence of Frank-Wolfe for rank-one matrix recovery without strong convexity, Linear convergence of an alternating polar decomposition method for low rank orthogonal tensor approximations, Mann-type algorithms for solving the monotone inclusion problem and the fixed point problem in reflexive Banach spaces, COAP 2021 best paper prize, New Bregman proximal type algoritms for solving DC optimization problems, Newton acceleration on manifolds identified by proximal gradient methods, Proximal Splitting Algorithms for Convex Optimization: A Tour of Recent Advances, with New Twists, A novel convergent filled function algorithm for multi-dimensional global optimization, Weak and strong convergence results for solving monotone variational inequalities in reflexive Banach spaces, A sequential ADMM algorithm to find sparse LCP solutions using a \(l_2-l_1\) regularization technique with application in bimatrix game, A constructive approach for computing the proximity operator of the \(p\)-th power of the \(\ell_1\) norm, New outer proximal methods for solving variational inequality problems, Some extensions of the operator splitting schemes based on Lagrangian and primal–dual: a unified proximal point analysis, An accelerated proximal gradient method for multiobjective optimization, Complexity analysis of interior-point methods for second-order stationary points of nonlinear semidefinite optimization problems, The homogenization cone: polar cone and projection, Nonconvex optimization with inertial proximal stochastic variance reduction gradient, Sparse feedback stabilization in high‐order linear systems, Dynamic string‐averaging CQ‐methods for the split feasibility problem with percentage violation constraints arising in radiation therapy treatment planning, Low-rank matrix recovery problem minimizing a new ratio of two norms approximating the rank function then using an ADMM-type solver with applications, Variance estimation in high-dimensional linear regression via adaptive elastic-net, Robust enhanced indexation optimization with sparse industry Layout constraint, The maximum a posteriori estimation model for signal recovery with mixed Gaussian and impulse noise, Sliced optimal transport on the sphere, Universal Conditional Gradient Sliding for Convex Optimization, Convergence Analysis of the Proximal Gradient Method in the Presence of the Kurdyka–Łojasiewicz Property Without Global Lipschitz Assumptions, Convex Bi-level Optimization Problems with Nonsmooth Outer Objective Function, Optimal polynomial feedback laws for finite horizon control problems, Sparse feedback stabilisation of linear delay systems by proximal gradient method, Variational analysis of norm cones in finite dimensional Euclidean spaces, Strongly Nonexpansive Mappings Revisited: Uniform Monotonicity and Operator Splitting, Adaptively weighted difference model of anisotropic and isotropic total variation for image denoising, Unified analysis of stochastic gradient methods for composite convex and smooth optimization, A speed restart scheme for a dynamics with Hessian-driven damping, A variable projection method for large-scale inverse problems with \(\ell^1\) regularization, Accelerated gradient methods with absolute and relative noise in the gradient, On convergence rates of proximal alternating direction method of multipliers, Smoothing unadjusted Langevin algorithms for nonsmooth composite potential functions, Gradient-Type Methods for Optimization Problems with Polyak-Łojasiewicz Condition: Early Stopping and Adaptivity to Inexactness Parameter, Study on convex optimization with least constraint violation under a general measure, An asynchronous subgradient-proximal method for solving additive convex optimization problems, An overview of stochastic quasi-Newton methods for large-scale machine learning, A mini-batch proximal stochastic recursive gradient algorithm with diagonal Barzilai-Borwein stepsize, Doubly iteratively reweighted algorithm for constrained compressed sensing models, Inertial projected gradient method for large-scale topology optimization, A doubly stochastic matrices-based approach to optimal qubit routing, Convergence rates of the stochastic alternating algorithm for bi-objective optimization, A distributed proximal gradient method with time-varying delays for solving additive convex optimizations, Softmax policy gradient methods can take exponential time to converge, Constrained composite optimization and augmented Lagrangian methods, Cauchy noise removal via convergent plug-and-play framework with outliers detection, Short paper -- A note on the Frank-Wolfe algorithm for a class of nonconvex and nonsmooth optimization problems, A Dynamic Smoothing Technique for a Class of Nonsmooth Optimization Problems on Manifolds, Optimal Methods for Convex Risk-Averse Distributed Optimization, Proximal gradient algorithm with trust region scheme on Riemannian manifold, Novel inertial methods for fixed point problems in reflexive Banach spaces with applications, An acceleration of proximal diagonal Newton method, Proximal variable smoothing method for three-composite nonconvex nonsmooth minimization with a linear operator, Globally convergent coderivative-based generalized Newton methods in nonsmooth optimization, Robust Accelerated Primal-Dual Methods for Computing Saddle Points, A physically admissible Stokes vector reconstruction in linear polarimetric imaging, Differentiating Nonsmooth Solutions to Parametric Monotone Inclusion Problems, Optimal Algorithms for Stochastic Complementary Composite Minimization, Alternated inertial algorithms for split feasibility problems, A proximal subgradient algorithm with extrapolation for structured nonconvex nonsmooth problems, Nested alternating minimization with FISTA for non-convex and non-smooth optimization problems, Stochastic incremental mirror descent algorithms with Nesterov smoothing, SOLO FTRL algorithm for production management with transfer prices, LASSO Reloaded: A Variational Analysis Perspective with Applications to Compressed Sensing, The Nonlocal Kelvin Principle and the Dual Approach to Nonlocal Control in the Conduction Coefficients, Sparse basis pursuit for compliance minimization in the vanishing volume ratio limit, Convergence Analysis of a Quasi-Monte CarloBased Deep Learning Algorithm for Solving Partial Differential Equations, Robust time-of-arrival localization via ADMM, Unnamed Item, Regularization of inverse problems via time discrete geodesics in image spaces, A Proximal Minimization Algorithm for Structured Nonconvex and Nonsmooth Problems, A Hybrid Finite-Dimensional RHC for Stabilization of Time-Varying Parabolic Equations, On the Convergence of Projected-Gradient Methods with Low-Rank Projections for Smooth Convex Minimization over Trace-Norm Balls and Related Problems, Regularisation, optimisation, subregularity, Regularization by Denoising via Fixed-Point Projection (RED-PRO), On the Convergence Rate of Projected Gradient Descent for a Back-Projection Based Objective, Ray-based inversion accounting for scattering for biomedical ultrasound tomography, SISAL Revisited, A primal-dual flow for affine constrained convex optimization, B-Subdifferentials of the Projection onto the Generalized Simplex, Nonconvex multi-view subspace clustering via simultaneously learning the representation tensor and affinity matrix*, An AO-ADMM Approach to Constraining PARAFAC2 on All Modes, Sparse Solutions of a Class of Constrained Optimization Problems, One-Step Estimation with Scaled Proximal Methods, Extrapolated Proximal Subgradient Algorithms for Nonconvex and Nonsmooth Fractional Programs, Bregman Finito/MISO for Nonconvex Regularized Finite Sum Minimization without Lipschitz Gradient Continuity, Smoothed Variable Sample-Size Accelerated Proximal Methods for Nonsmooth Stochastic Convex Programs, Proximal operator and optimality conditions for ramp loss SVM, Off-diagonal symmetric nonnegative matrix factorization, A fixed-point proximity algorithm for recovering low-rank components from incomplete observation data with application to motion capture data refinement, Convergence rate analysis for the higher order power method in best rank one approximations of tensors, 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., Nonsmoothness in machine learning: specific structure, proximal identification, and applications, 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, A simplified view of first order methods for optimization, 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), 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, Proximal Methods for Sparse Optimal Scoring and Discriminant Analysis, 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 \(\ell_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, Evasive path planning under surveillance uncertainty, 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, Parseval proximal neural networks, 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, On the Frank–Wolfe algorithm for non-compact constrained optimization problems, Model-Based Derivative-Free Methods for Convex-Constrained Optimization, ADJUST: a dictionary-based joint reconstruction and unmixing method for spectral tomography, Accelerated projected gradient method with adaptive step size for compliance minimization problem, A Bregman subgradient extragradient method with self-adaptive technique for solving variational inequalities in reflexive Banach spaces, Deep Learning--Based Dictionary Learning and Tomographic Image Reconstruction, A Columnwise Update Algorithm for Sparse Stochastic Matrix Factorization, Revisiting linearized Bregman iterations under Lipschitz-like convexity condition, Solving Stochastic Optimization with Expectation Constraints Efficiently by a Stochastic Augmented Lagrangian-Type Algorithm, A Penalty Branch-and-Bound Method for Mixed Binary Linear Complementarity Problems, An Algorithm for Maximizing a Convex Function Based on Its Minimum, Two New Inertial Algorithms for Solving Variational Inequalities in Reflexive Banach Spaces, A Subspace Acceleration Method for Minimization Involving a Group Sparsity-Inducing Regularizer, A Variable Sample-Size Stochastic Quasi-Newton Method for Smooth and Nonsmooth Stochastic Convex Optimization, Safe feature screening rules for the regularized Huber regression, A Proximal Quasi-Newton Trust-Region Method for Nonsmooth Regularized Optimization, Continuous-Time Convergence Rates in Potential and Monotone Games, Joint image reconstruction method with correlative multi-channel prior for x-ray spectral computed tomography, Globally Solving the Trust Region Subproblem Using Simple First-Order Methods, On the convergence of recursive SURE for total variation minimization, Efficient computation of the nearest polynomial by linearized alternating direction method, On the linear convergence of a Bregman proximal point algorithm, An extended primal-dual algorithm framework for nonconvex problems: application to image reconstruction in spectral CT, Two Bregman projection methods for solving variational inequalities, A proximal algorithm with backtracked extrapolation for a class of structured fractional programming, Adaptive two-stage Bregman method for variational inequalities, Golden Ratio Primal-Dual Algorithm with Linesearch, On the equivalence of statistical distances for isotropic convex measures, A Generalized Primal-Dual Algorithm with Improved Convergence Condition for Saddle Point Problems, On linear and super-linear convergence of natural policy gradient algorithm, Nonsmooth rank-one matrix factorization landscape, On connections between amplitude flow and error reduction for phase retrieval and ptychography, Discrete total variation with finite elements and applications to imaging, Analysis of two versions of relaxed inertial algorithms with Bregman divergences for solving variational inequalities, On the application of the SCD semismooth* Newton method to variational inequalities of the second kind, Regrets of proximal method of multipliers for online non-convex optimization with long term constraints, Unnamed Item, Unnamed Item, Unnamed Item, Unnamed Item, Fixed-Point-like method for a new Total variation-based image restoration model, First-order methods almost always avoid strict saddle points, A generalized forward-backward splitting operator: degenerate analysis and applications, Perturbed Fenchel duality and first-order methods, A globally convergent proximal Newton-type method in nonsmooth convex optimization, Convergence rates analysis of a multiobjective proximal gradient method, Unnamed Item, A proximal quasi-Newton method based on memoryless modified symmetric rank-one formula, Complexity guarantees for an implicit smoothing-enabled method for stochastic MPECs, An online convex optimization-based framework for convex bilevel optimization, Difference of convex algorithms for bilevel programs with applications in hyperparameter selection, The Proximal Alternating Direction Method of Multipliers in the Nonconvex Setting: Convergence Analysis and Rates, Zeroth-order nonconvex stochastic optimization: handling constraints, high dimensionality, and saddle points, A subgradient method with non-monotone line search, A smoothing proximal gradient algorithm with extrapolation for the relaxation of \({\ell_0}\) regularization problem, Accelerated stochastic variance reduction for a class of convex optimization problems, Bregman three-operator splitting methods, Proximal gradient algorithm for nonconvex low tubal rank tensor recovery, A modified conjugate gradient method for general convex functions, A dual-primal balanced augmented Lagrangian method for linearly constrained convex programming, An inexact Riemannian proximal gradient method, Unnamed Item, Accelerating Proximal Markov Chain Monte Carlo by Using an Explicit Stabilized Method, Relaxed Gauss--Newton Methods with Applications to Electrical Impedance Tomography, Unnamed Item, On the weak stationarity conditions for mathematical programs with cardinality constraints: a unified approach, Convolutional proximal neural networks and plug-and-play algorithms, Variable Projection for NonSmooth Problems, Unnamed Item, FOM – a MATLAB toolbox of first-order methods for solving convex optimization problems, An Accelerated Inexact Proximal Point Method for Solving Nonconvex-Concave Min-Max Problems, Local Convergence Analysis of Augmented Lagrangian Methods for Piecewise Linear-Quadratic Composite Optimization Problems, On starting and stopping criteria for nested primal-dual iterations, Complexity of gradient descent for multiobjective optimization, Smoothing algorithms for computing the projection onto a Minkowski sum of convex sets, A Scale-Invariant Approach for Sparse Signal Recovery, CoShaRP: a convex program for single-shot tomographic shape sensing, An entropic Landweber method for linear ill-posed problems, On phase retrieval via matrix completion and the estimation of low rank PSD matrices, Accelerated proximal incremental algorithm schemes for non-strongly convex functions, Optimally linearizing the alternating direction method of multipliers for convex programming, Convergence Rates of Inertial Primal-Dual Dynamical Methods for Separable Convex Optimization Problems, Safe feature elimination for non-negativity constrained convex optimization, A first-order image denoising model for staircase reduction, Resource Allocation in Communication Networks with Large Number of Users: The Dual Stochastic Gradient Method, An \(\ell^p\)-\(\ell^q\) minimization method with cross-validation for the restoration of impulse noise contaminated images, A partially inexact proximal alternating direction method of multipliers and its iteration-complexity analysis, MultiLevel Composite Stochastic Optimization via Nested Variance Reduction, Convergence of two-stage method with Bregman divergence for solving variational inequalities, Bregman extragradient method with monotone rule of step adjustment, Computational approaches to non-convex, sparsity-inducing multi-penalty regularization, Proximal-Like Incremental Aggregated Gradient Method with Linear Convergence Under Bregman Distance Growth Conditions, On linear convergence of non-Euclidean gradient methods without strong convexity and Lipschitz gradient continuity, Variable Projection for NonSmooth Problems, Unnamed Item, Efficient Algorithms for Distributionally Robust Stochastic Optimization with Discrete Scenario Support, Dual Randomized Coordinate Descent Method for Solving a Class of Nonconvex Problems, Recovery of a Time-Dependent Bottom Topography Function from the Shallow Water Equations via an Adjoint Approach, A Proximal Bundle Variant with Optimal Iteration-Complexity for a Large Range of Prox Stepsizes, A Study of Convex Convex-Composite Functions via Infimal Convolution with Applications, Inexact proximal DC Newton-type method for nonconvex composite functions, Riemannian thresholding methods for row-sparse and low-rank matrix recovery, Block mirror stochastic gradient method for stochastic optimization, A refined inertial DC algorithm for DC programming, Simple and fast algorithm for binary integer and online linear programming, Data driven discovery of systems of ordinary differential equations using nonconvex multitask learning, Policy Mirror Descent for Regularized Reinforcement Learning: A Generalized Framework with Linear Convergence, A forward-backward algorithm with different inertial terms for structured non-convex minimization problems, An elementary approach to tight worst case complexity analysis of gradient based methods, Methodology and first-order algorithms for solving nonsmooth and non-strongly convex bilevel optimization problems, A proximal trust-region method for nonsmooth optimization with inexact function and gradient evaluations, Consensus-based Dantzig-Wolfe decomposition, On approximate optimality conditions for robust multi-objective convex optimization problems, First-order methods for convex optimization, Stochastic variable metric proximal gradient with variance reduction for non-convex composite optimization, Tensor Robust Principal Component Analysis via Tensor Fibered Rank and \({\boldsymbol{{l_p}}}\) Minimization, The forward-backward envelope for sampling with the overdamped Langevin algorithm, A variable metric and Nesterov extrapolated proximal DCA with backtracking for a composite DC program, An approximate Newton-type proximal method using symmetric rank-one updating formula for minimizing the nonsmooth composite functions, Proximal gradient/semismooth Newton methods for projection onto a polyhedron via the duality-gap-active-set strategy, PCA Sparsified, Inertial‐like Bregman projection method for solving systems of variational inequalities, Inexact proximal Newton methods in Hilbert spaces, Bayesian Trend Filtering via Proximal Markov Chain Monte Carlo, The operator splitting schemes revisited: primal-dual gap and degeneracy reduction by a unified analysis, An inexact primal-dual smoothing framework for large-scale non-bilinear saddle point problems, Diffusion optical tomography reconstruction based on convex–nonconvex graph total variation regularization, Scaled proximal gradient methods for sparse optimization problems, Sharper Bounds for Proximal Gradient Algorithms with Errors, On inertial iterated Tikhonov methods for solving ill-posed problems, Various Notions of Nonexpansiveness Coincide for Proximal Mappings of Functions, A Riemannian Proximal Newton Method, A Path-Based Approach to Constrained Sparse Optimization, Local convergence analysis of an inexact trust-region method for nonsmooth optimization, Adaptive Catalyst for Smooth Convex Optimization
Uses Software
