Lectures on convex optimization
From MaRDI portal
Publication:723525
DOI10.1007/978-3-319-91578-4zbMath1427.90003OpenAlexW2901838001MaRDI QIDQ723525
Publication date: 23 July 2018
Published in: Springer Optimization and Its Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-319-91578-4
Convex programming (90C25) Minimax problems in mathematical programming (90C47) Nonlinear programming (90C30) Interior-point methods (90C51) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to operations research and mathematical programming (90-01)
Related Items (only showing first 100 items - show all)
A Riemannian Proximal Newton Method ⋮ Adaptive Catalyst for Smooth Convex Optimization ⋮ Recent theoretical advances in decentralized distributed convex optimization ⋮ Recent Theoretical Advances in Non-Convex Optimization ⋮ Verified reductions for optimization ⋮ Computing conjugate barrier information for nonsymmetric cones ⋮ Global contractivity for Langevin dynamics with distribution-dependent forces and uniform in time propagation of chaos ⋮ Global stability of first-order methods for coercive tame functions ⋮ Hessian barrier algorithms for non-convex conic optimization ⋮ Inexact reduced gradient methods in nonconvex optimization ⋮ On a minimization problem of the maximum generalized eigenvalue: properties and algorithms ⋮ Best subset selection for high-dimensional non-smooth models using iterative hard thresholding ⋮ SPIRAL: a superlinearly convergent incremental proximal algorithm for nonconvex finite sum minimization ⋮ Additive Schwarz methods for semilinear elliptic problems with convex energy functionals: convergence rate independent of nonlinearity ⋮ Another approach to build Lyapunov functions for the first order methods in the quadratic case ⋮ Parameter-free accelerated gradient descent for nonconvex minimization ⋮ Mini-batch stochastic subgradient for functional constrained optimization ⋮ A stochastic moving ball approximation method for smooth convex constrained minimization ⋮ Non-ergodic convergence rate of an inertial accelerated primal-dual algorithm for saddle point problems ⋮ Automated tight Lyapunov analysis for first-order methods ⋮ Communication-efficient distributed cubic Newton with compressed lazy Hessian ⋮ Stochastic Gauss-Seidel type inertial proximal alternating linearized minimization and its application to proximal neural networks ⋮ Polynomial preconditioners for regularized linear inverse problems ⋮ Variance reduced moving balls approximation method for smooth constrained minimization problems ⋮ Derivative-free alternating projection algorithms for general nonconvex-concave minimax problems ⋮ Momentum-based accelerated mirror descent stochastic approximation for robust topology optimization under stochastic loads ⋮ Properties and practicability of convergence-guaranteed optimization methods derived from weak discrete gradients ⋮ Semi-definite programming and quantum information ⋮ A novel stepsize for gradient descent method ⋮ A subgradient method with constant step-size for \(\ell_1\)-composite optimization ⋮ A digital economy development index based on an improved hierarchical data envelopment analysis approach ⋮ An inexactly accelerated algorithm for nonnegative tensor CP decomposition with the column unit constraints ⋮ Splitting augmented Lagrangian-type algorithms with partial quadratic approximation to solve sparse signal recovery problems ⋮ Subgradient regularized multivariate convex regression at scale ⋮ The geometric median and applications to robust mean estimation ⋮ Inexact tensor methods and their application to stochastic convex optimization ⋮ One-shot learning of surrogates in PDE-constrained optimization under uncertainty ⋮ Initialization-free Lie-bracket extremum seeking ⋮ Robust fixed-time distributed optimization with predefined convergence-time bound ⋮ Mixing of Metropolis-adjusted Markov chains via couplings: the high acceptance regime ⋮ On the rate of convergence of the difference-of-convex algorithm (DCA) ⋮ Stochastic mirror descent for convex optimization with consensus constraints ⋮ Complexity-optimal and parameter-free first-order methods for finding stationary points of composite optimization problems ⋮ Almost sure convergence rates of stochastic proximal gradient descent algorithm ⋮ Short-step methods are not strongly polynomial-time ⋮ Super-twisting sliding mode control with accelerated gradient descent method for synchronous reluctance motor control system ⋮ Accelerated SVD-based initialization for nonnegative matrix factorization ⋮ A search-free \(O(1/k^{3/2})\) homotopy inexact proximal-Newton extragradient algorithm for monotone variational inequalities ⋮ Zeroth-order Riemannian averaging stochastic approximation algorithms ⋮ Efficient first order method for saddle point problems with higher order smoothness ⋮ Lagrangian relaxation for continuous-time optimal control of coupled hydrothermal power systems including storage capacity and a cascade of hydropower systems with time delays ⋮ Stochastic variance-reduced majorization-minimization algorithms ⋮ No dimension-free deterministic algorithm computes approximate stationarities of Lipschitzians ⋮ High-order methods beyond the classical complexity bounds: inexact high-order proximal-point methods ⋮ On convergence of a \(q\)-random coordinate constrained algorithm for non-convex problems ⋮ Fast convex optimization via differential equation with Hessian-driven damping and Tikhonov regularization ⋮ An augmented Lagrangian method for state constrained linear parabolic optimal control problems ⋮ Finite-time nonconvex optimization using time-varying dynamical systems ⋮ Nonsmooth projection-free optimization with functional constraints ⋮ Enhancing classification modeling through feature selection and smoothness: a conic-fused Lasso approach integrated with mean shift outlier modelling ⋮ A mirror inertial forward-reflected-backward splitting: convergence analysis beyond convexity and Lipschitz smoothness ⋮ Bregman proximal linearized ADMM for minimizing separable sums coupled by a difference of functions ⋮ Convergence rate analysis of the gradient descent–ascent method for convex–concave saddle-point problems ⋮ High probability bounds on AdaGrad for constrained weakly convex optimization ⋮ Primal subgradient methods with predefined step sizes ⋮ Polyak minorant method for convex optimization ⋮ The ``black-box optimization problem: zero-order accelerated stochastic method via kernel approximation ⋮ Accelerated optimization landscape of linear-quadratic regulator ⋮ Computing subgradients of convex relaxations for solutions of parametric ordinary differential equations ⋮ Accuracy certificates for convex minimization with inexact oracle ⋮ Kurdyka-Łojasiewicz exponent via Hadamard parametrization ⋮ SketchySGD: reliable stochastic optimization via randomized curvature estimates ⋮ Several kinds of acceleration techniques for unconstrained optimization first-order algorithms ⋮ Accelerated first-order methods for a class of semidefinite programs ⋮ Perseus: a simple and optimal high-order method for variational inequalities ⋮ An incremental descent method for multi-objective optimization ⋮ A Scalable Algorithm for Sparse Portfolio Selection ⋮ New computational methods for classification problems in the existence of outliers based on conic quadratic optimization ⋮ Constraint qualifications in nonsmooth optimization: Classification and inter-relations ⋮ Potential Function-Based Framework for Minimizing Gradients in Convex and Min-Max Optimization ⋮ A Splitting Scheme for Flip-Free Distortion Energies ⋮ Subgradient ellipsoid method for nonsmooth convex problems ⋮ Optimal error bounds for non-expansive fixed-point iterations in normed spaces ⋮ New Bregman proximal type algoritms for solving DC optimization problems ⋮ Error estimates of a theta-scheme for second-order mean field games ⋮ A nonlinear conjugate gradient method using inexact first-order information ⋮ SCORE: approximating curvature information under self-concordant regularization ⋮ Global convergence of the gradient method for functions definable in o-minimal structures ⋮ Nonconvex optimization with inertial proximal stochastic variance reduction gradient ⋮ An Apocalypse-Free First-Order Low-Rank Optimization Algorithm with at Most One Rank Reduction Attempt per Iteration ⋮ An Efficient and Robust Scalar Auxialiary Variable Based Algorithm for Discrete Gradient Systems Arising from Optimizations ⋮ Stochastic momentum methods for non-convex learning without bounded assumptions ⋮ Optimal Self-Concordant Barriers for Quantum Relative Entropies ⋮ Robust sampled‐data controller design for uncertain nonlinear systems via Euler discretization ⋮ Zeroth-order algorithms for nonconvex-strongly-concave minimax problems with improved complexities ⋮ Some accelerated alternating proximal gradient algorithms for a class of nonconvex nonsmooth problems ⋮ An improved inertial projection method for solving convex constrained monotone nonlinear equations with applications ⋮ Neural‐network‐based constrained optimal coordination for heterogeneous uncertain nonlinear multi‐agent systems ⋮ Universal Conditional Gradient Sliding for Convex Optimization ⋮ Convergence of the Momentum Method for Semialgebraic Functions with Locally Lipschitz Gradients
This page was built for publication: Lectures on convex optimization
