Quadratic Approximations in Convex Nondifferentiable Optimization

DOI10.1137/0329003zbMATH Open0741.90064OpenAlexW2012183861MaRDI QIDQ3977033FDOQ3977033

Authors Maria Flavia Monaco, Manlio Gaudioso

Publication date 25 June 1992

Published in SIAM Journal on Control and Optimization (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/0329003

zbMATH Keywords

descent methodnon-smooth optimizationquadratic approximationunconstrained convex minimizationsuccessive quadratic programs

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Convex programming (90C25) Nonlinear programming (90C30) Nonsmooth analysis (49J52) Computational methods for problems pertaining to operations research and mathematical programming (90-08)

Recommendations

• A descent method with linear programming subproblems for nondifferentiable convex optimization
• A quadratic approximation method for minimizing a class of quasidifferentiable functions
• scientific article; zbMATH DE number 3924518
• An approximate subgradient algorithm for unconstrained nonsmooth, nonconvex optimization
• scientific article; zbMATH DE number 67982

Cited in

(26)

• Piecewise-quadratic approximations in convex numerical optimization
• A quadratic approximation method for minimizing a class of quasidifferentiable functions
• scientific article; zbMATH DE number 3970535 (Why is no real title available?)
• Variants to the cutting plane approach for convex nondifferentiable optimization
• scientific article; zbMATH DE number 708837 (Why is no real title available?)
• A fifth bibliography of fractional programming^*
• scientific article; zbMATH DE number 3865002 (Why is no real title available?)
• A subgradient method for unconstrained nonconvex nonsmooth optimization
• Tuning strategy for the proximity parameter in convex minimization
• scientific article; zbMATH DE number 4007605 (Why is no real title available?)
• Nonconvex approximations in unconstrained minimization
• Approximation Bounds for Quadratic Optimization with Homogeneous Quadratic Constraints
• scientific article; zbMATH DE number 554533 (Why is no real title available?)
• Nonmonotone bundle-type scheme for convex nonsmooth minimization
• The quadratic functional as an indicator of the convergence of approximate methods
• A partially inexact bundle method for convex semi-infinite minmax problems
• Essentials of numerical nonsmooth optimization
• scientific article; zbMATH DE number 4054242 (Why is no real title available?)
• An approximate subgradient algorithm for unconstrained nonsmooth, nonconvex optimization
• Nonconvex minimization of a quadratic function over a sphere
• scientific article; zbMATH DE number 6474937 (Why is no real title available?)
• Permanently going back and forth between the ``quadratic world and the ``convexity world in optimization
• Linearly convergent descent methods for the unconstrained minimization of convex quadratic splines
• Essentials of numerical nonsmooth optimization
• Solving nearly-separable quadratic optimization problems as nonsmooth equations
• New and old bounds for standard quadratic optimization: dominance, equivalence and incomparability

This page was built for publication: Quadratic Approximations in Convex Nondifferentiable Optimization

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3977033)