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

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

Cited In (25)

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

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)