Compositions of convex functions and fully linear models
From MaRDI portal
Publication:1679619
DOI10.1007/s11590-017-1117-xzbMath1408.90323arXiv1612.05190OpenAlexW2589061561MaRDI QIDQ1679619
Publication date: 9 November 2017
Published in: Optimization Letters (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1612.05190
Related Items (5)
A discussion on variational analysis in derivative-free optimization ⋮ Manifold Sampling for Optimization of Nonconvex Functions That Are Piecewise Linear Compositions of Smooth Components ⋮ Derivative-free robust optimization by outer approximations ⋮ Derivative-free optimization methods ⋮ Calculus Identities for Generalized Simplex Gradients: Rules and Applications
Uses Software
Cites Work
- Unnamed Item
- A derivative-free approximate gradient sampling algorithm for finite minimax problems
- On trust region methods for unconstrained minimization without derivatives
- UOBYQA: unconstrained optimization by quadratic approximation
- Derivative-free optimization via proximal point methods
- The calculus of simplex gradients
- Optimizing damper connectors for adjacent buildings
- Geometry of interpolation sets in derivative free optimization
- Global Convergence of Radial Basis Function Trust Region Derivative-Free Algorithms
- A derivative-free comirror algorithm for convex optimization
- Using Sampling and Simplex Derivatives in Pattern Search Methods
- Developments of NEWUOA for minimization without derivatives
- Geometry of sample sets in derivative-free optimization: polynomial regression and underdetermined interpolation
- Introduction to Derivative-Free Optimization
- Variational Analysis
- Global Convergence of General Derivative-Free Trust-Region Algorithms to First- and Second-Order Critical Points
- Manifold Sampling for $\ell_1$ Nonconvex Optimization
- Convex analysis and monotone operator theory in Hilbert spaces
This page was built for publication: Compositions of convex functions and fully linear models
