A derivative-free comirror algorithm for convex optimization
From MaRDI portal
Publication:3458813
DOI10.1080/10556788.2014.968158zbMath1328.90104arXiv1210.6403OpenAlexW2162546528MaRDI QIDQ3458813
Walaa M. Moursi, Heinz H. Bauschke, Warren L. Hare
Publication date: 28 December 2015
Published in: Optimization Methods and Software (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1210.6403
convex optimizationderivative-free optimizationapproximate subgradientBregman distancelower-\(\mathcal{C}^2\)non-Euclidean projected subgradient
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (4)
Compositions of convex functions and fully linear models ⋮ Limiting behaviour of the generalized simplex gradient as the number of points tends to infinity on a fixed shape in \(\mathrm{IR}^n\) ⋮ Derivative-Free Optimization of Noisy Functions via Quasi-Newton Methods ⋮ Derivative-free optimization methods
Cites Work
- Unnamed Item
- A derivative-free approximate gradient sampling algorithm for finite minimax problems
- CONDOR, a new parallel, constrained extension of Powell's UOBYQA algorithm: Experimental results and comparison with the DFO algorithm
- The CoMirror algorithm for solving nonsmooth constrained convex problems
- Worst case complexity of direct search
- Objective-derivative-free methods for constrained optimization
- Mirror descent and nonlinear projected subgradient methods for convex optimization.
- UOBYQA: unconstrained optimization by quadratic approximation
- Smoothed analysis of \(\kappa(A)\)
- Geometry of interpolation sets in derivative free optimization
- The Ordered Subsets Mirror Descent Optimization Method with Applications to Tomography
- Smoothing and worst-case complexity for direct-search methods in nonsmooth optimization
- Sequential Penalty Derivative-Free Methods for Nonlinear Constrained Optimization
- An active-set trust-region method for derivative-free nonlinear bound-constrained optimization
- Convergence Analysis of a Proximal-Like Minimization Algorithm Using Bregman Functions
- OrthoMADS: A Deterministic MADS Instance with Orthogonal Directions
- Introduction to Derivative-Free Optimization
- Variational Analysis
- Derivative-free optimization methods for finite minimax problems
- Benchmarking Derivative-Free Optimization Algorithms
- A Derivative-Free Algorithm for Linearly Constrained Finite Minimax Problems
- Mesh Adaptive Direct Search Algorithms for Constrained Optimization
- Convex Analysis
This page was built for publication: A derivative-free comirror algorithm for convex optimization
