scientific article; zbMATH DE number 4045492
From MaRDI portal
Publication:3783084
Recommendations
- A method of linearizations for linearly constrained nonconvex nonsmooth minimization
- A Linearization Algorithm for Nonsmooth Minimization
- scientific article; zbMATH DE number 3924518
- An algorithm for linearly constrained convex nondifferentiable minimization problems
- An approximate subgradient algorithm for unconstrained nonsmooth, nonconvex optimization
Cited in
(16)- An aggregate subgradient method for nonsmooth and nonconvex minimization
- A bracketing technique to ensure desirable convergence in univariate minimization
- A rapidly convergent five-point algorithm for univariate minimization
- A minimizing algorithm for complex nonconvex nondifferentiable functions
- An approximate subgradient algorithm for unconstrained nonsmooth, nonconvex optimization
- scientific article; zbMATH DE number 6613055 (Why is no real title available?)
- scientific article; zbMATH DE number 5653878 (Why is no real title available?)
- scientific article; zbMATH DE number 3896207 (Why is no real title available?)
- A Linearization Algorithm for Nonsmooth Minimization
- scientific article; zbMATH DE number 3924518 (Why is no real title available?)
- A method of linearizations for linearly constrained nonconvex nonsmooth minimization
- scientific article; zbMATH DE number 1286827 (Why is no real title available?)
- scientific article; zbMATH DE number 222939 (Why is no real title available?)
- A Robust Gradient Sampling Algorithm for Nonsmooth, Nonconvex Optimization
- Gobally convergent variable metric method for nonconvex nondifferentiable unconstrained minimization
- Improved convergence result for the discrete gradient and secant methods for nonsmooth optimization
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3783084)
