Minimizing oracle-structured composite functions
From MaRDI portal
Publication:6173766
DOI10.1007/s11081-021-09705-0zbMath1530.90080arXiv2105.14153OpenAlexW4205181105MaRDI QIDQ6173766
Stephen P. Boyd, Xinyue Shen, Alnur Ali
Publication date: 13 July 2023
Published in: Optimization and Engineering (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2105.14153
structured optimizationcomposite convex optimizationfirst-order oraclesquasi-second-order methodstuning-free methods
Numerical mathematical programming methods (65K05) Convex programming (90C25) Nonlinear programming (90C30) Newton-type methods (49M15)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A doubly stabilized bundle method for nonsmooth convex optimization
- Conic optimization via operator splitting and homogeneous self-dual embedding
- Practical inexact proximal quasi-Newton method with global complexity analysis
- Gradient methods for minimizing composite functions
- Convex proximal bundle methods in depth: a unified analysis for inexact oracles
- Inexact proximal Newton methods for self-concordant functions
- Fat tails, VaR and subadditivity
- Exponential series estimator of multivariate densities
- Optimal portfolio allocation under the probabilistic VaR constraint and incentives for financial innovation
- Coherent risk measures in inventory problems
- Proximity control in bundle methods for convex nondifferentiable minimization
- Goodness of fit tests via exponential series density estimation
- A bundle-Newton method for nonsmooth unconstrained minimization
- Representations of quasi-Newton matrices and their use in limited memory methods
- Variable metric bundle methods: From conceptual to implementable forms
- Efficiency of proximal bundle methods
- A family of inexact SQA methods for non-smooth convex minimization with provable convergence guarantees based on the Luo-Tseng error bound property
- Proximal quasi-Newton methods for regularized convex optimization with linear and accelerated sublinear convergence rates
- A quasi-second-order proximal bundle algorithm
- New variants of bundle methods
- Inexact successive quadratic approximation for regularized optimization
- Minimization of functions having Lipschitz continuous first partial derivatives
- A globally convergent proximal Newton-type method in nonsmooth convex optimization
- A strongly convergent proximal bundle method for convex minimization in Hilbert spaces
- CVXPY: A Python-Embedded Modeling Language for Convex Optimization
- A Quasi-Newton Approach to Nonsmooth Convex Optimization Problems in Machine Learning
- Introduction to Nonsmooth Optimization
- Proximal Newton-Type Methods for Minimizing Composite Functions
- A New Low Rank Quasi-Newton Update Scheme for Nonlinear Programming
- A descent algorithm for nonsmooth convex optimization
- A Stochastic Estimator of the Trace of the Influence Matrix for Laplacian Smoothing Splines
- Graphical Models, Exponential Families, and Variational Inference
- Variable Metric Method for Minimization
- A Version of the Bundle Idea for Minimizing a Nonsmooth Function: Conceptual Idea, Convergence Analysis, Numerical Results
- Quasi-Newton Methods, Motivation and Theory
- Quasi-Newton Bundle-Type Methods for Nondifferentiable Convex Optimization
- Incremental Bundle Methods using Upper Models
- Generalized Bundle Methods
- On Quasi-Newton Forward-Backward Splitting: Proximal Calculus and Convergence
- A Class of Methods for Solving Nonlinear Simultaneous Equations
- A Rapidly Convergent Descent Method for Minimization
- Bundle Method for Non-Convex Minimization with Inexact Subgradients and Function Values
