scientific article; zbMATH DE number 3874967

MaRDI QIDQ3340505zbMATH OpenFDO

Authors Robert Mifflin

Publication date 1984

zbMATH Keywords

better than linear convergencemultivariable problemsnonsmooth optimization

Mathematics Subject Classification ID

Numerical methods based on nonlinear programming (49M37) Numerical mathematical programming methods (65K05) Nonlinear programming (90C30)

Recommendations

• On superlinear convergence in univariate nonsmooth minimization
• A Linearization Algorithm for Nonsmooth Minimization
• A method of linearizations for linearly constrained nonconvex nonsmooth minimization
• Nonsmooth variants of Powell's BFGS convergence theorem
• Global convergence of line search method for nonsmooth optimization

Cited in

(6)

• A constraint linearization method for nondifferentiable convex minimization
• A bracketing technique to ensure desirable convergence in univariate minimization
• A bundle-Newton method for nonsmooth unconstrained minimization
• A rapidly convergent five-point algorithm for univariate minimization
• A quasi-second-order proximal bundle algorithm
• On superlinear convergence in univariate nonsmooth minimization

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 Q3340505)