Derivative-free optimization via proximal point methods
From MaRDI portal
Publication:2250069
Recommendations
Cites work
- A \(\mathcal{VU}\)-algorithm for convex minimization
- A bundle-Newton method for nonsmooth unconstrained minimization
- A computational framework for derivative-free optimization of cardiovascular geometries
- A family of derivative-free conjugate gradient methods for large-scale nonlinear systems of equations
- A modification and an extension of Lemarechal’s algorithm for nonsmooth minimization
- A Proximal Bundle Method with Approximate Subgradient Linearizations
- A proximal bundle method with inexact data for convex nondifferentiable minimization
- A proximal method for identifying active manifolds
- A proximity control algorithm to minimize nonsmooth and nonconvex semi-infinite maximum eigenvalue functions
- A redistributed proximal bundle method for nonconvex optimization
- An inexact bundle approach to cutting-stock problems
- An inexact bundle variant suited to column generation
- Computing proximal points of nonconvex functions
- Geometry of interpolation sets in derivative free optimization
- Geometry of sample sets in derivative-free optimization: polynomial regression and underdetermined interpolation
- Globalization strategies for mesh adaptive direct search
- scientific article; zbMATH DE number 439380 (Why is no real title available?)
- scientific article; zbMATH DE number 2128203 (Why is no real title available?)
- scientific article; zbMATH DE number 3846333 (Why is no real title available?)
- scientific article; zbMATH DE number 1301898 (Why is no real title available?)
- scientific article; zbMATH DE number 2155014 (Why is no real title available?)
- scientific article; zbMATH DE number 1873048 (Why is no real title available?)
- scientific article; zbMATH DE number 5060482 (Why is no real title available?)
- scientific article; zbMATH DE number 3359250 (Why is no real title available?)
- Hybrid genetic algorithms and artificial neural networks for complex design optimization in CFD
- Introduction to Derivative-Free Optimization
- Prox-regularity and stability of the proximal mapping
- Survey of Bundle Methods for Nonsmooth Optimization
- Trailing-edge noise reduction using derivative-free optimization and large-eddy simulation
- Variational Analysis
- 𝒱𝒰-smoothness and proximal point results for some nonconvex functions
Cited in
(18)- Compositions of convex functions and fully linear models
- Derivative-free superiorization with component-wise perturbations
- Derivative-free superiorization: principle and algorithm
- Derivative-free robust optimization by outer approximations
- Stochastic derivative-free optimization using a trust region framework
- Derivative-Free Optimization
- Traditional and hybrid derivative-free optimization approaches for black box functions
- scientific article; zbMATH DE number 1971709 (Why is no real title available?)
- scientific article; zbMATH DE number 1552017 (Why is no real title available?)
- Derivative-free optimization methods for finite minimax problems
- Conjugate gradient path method without line search technique for derivative-free unconstrained optimization
- A derivative-free \(\mathcal{V} \mathcal{U}\)-algorithm for convex finite-max problems
- Derivative-free optimization methods
- Wedge trust region method for derivative free optimization.
- Derivative-free optimization on Riemannian manifolds using simplex gradient approximations
- Globally convergent derivative-free methods in nonconvex optimization with and without noise
- A globally convergent trust-region algorithm for unconstrained derivative-free optimization
- A discussion on variational analysis in derivative-free optimization
This page was built for publication: Derivative-free optimization via proximal point methods
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2250069)
