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 (only showing first 100 items - show all)
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 ⋮ On the Frank–Wolfe algorithm for non-compact constrained optimization problems
Uses Software
This page was built for publication: First-Order Methods in Optimization
