A derivative-free comirror algorithm for convex optimization
type: Item
instance of: scholarly article
title: A derivative-free comirror algorithm for convex optimization
zbMATH Open document ID: 1328.90104
DOI: 10.1080/10556788.2014.968158
author: Heinz H. Bauschke
author: Walaa M. Moursi
author: Warren L. Hare
publication date: 2015-12-28T00:00:00Z
full work available at URL: https://arxiv.org/abs/1210.6403
Mathematics Subject Classification ID: 90C25
Mathematics Subject Classification ID: 90C56
Mathematics Subject Classification ID: 49M30
Mathematics Subject Classification ID: 65K10
zbMATH DE Number: 6524248
zbMATH Keywords: convex optimization
zbMATH Keywords: derivative-free optimization
zbMATH Keywords: lower-\(\mathcal{C}^2\)
zbMATH Keywords: approximate subgradient
zbMATH Keywords: non-Euclidean projected subgradient
zbMATH Keywords: Bregman distance
MaRDI profile type: Publication
OpenAlex ID: W2162546528
arXiv ID: 1210.6403
cites work: OrthoMADS: A Deterministic MADS Instance with Orthogonal Directions
cites work: Mesh Adaptive Direct Search Algorithms for Constrained Optimization
cites work: The CoMirror algorithm for solving nonsmooth constrained convex problems
cites work: Mirror descent and nonlinear projected subgradient methods for convex optimization.
cites work: The ordered subsets mirror descent optimization method with applications to tomography
cites work: Convergence Analysis of a Proximal-Like Minimization Algorithm Using Bregman Functions
cites work: Geometry of interpolation sets in derivative free optimization
cites work: Introduction to Derivative-Free Optimization
cites work: Q4421517
cites work: Smoothing and worst-case complexity for direct-search methods in nonsmooth optimization
cites work: An active-set trust-region method for derivative-free nonlinear bound-constrained optimization
cites work: Derivative-free optimization methods for finite minimax problems
cites work: A derivative-free approximate gradient sampling algorithm for finite minimax problems
cites work: A Derivative-Free Algorithm for Linearly Constrained Finite Minimax Problems
cites work: Sequential Penalty Derivative-Free Methods for Nonlinear Constrained Optimization
cites work: Objective-derivative-free methods for constrained optimization
cites work: Benchmarking Derivative-Free Optimization Algorithms
cites work: UOBYQA: unconstrained optimization by quadratic approximation
cites work: Convex Analysis
cites work: Variational Analysis
cites work: CONDOR, a new parallel, constrained extension of Powell's UOBYQA algorithm: Experimental results and comparison with the DFO algorithm
cites work: Worst case complexity of direct search
cites work: Smoothed analysis of \(\kappa(A)\)
published in: Optimization Methods \& Software
description: scientific article