A modified reduced gradient method for a class of nondifferentiable problems

DOI10.1007/BF01581637MaRDI QIDQ3902833zbMATH OpenOpenAlexFDO

Authors Yves Smeers, Willy Gochet

Publication date 1980

Published in Mathematical Programming (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/bf01581637

zbMATH Keywords

convergencedual problemfaithfully convex functionsmodified reduced gradient methodnondifferentiable optimizationprimal problem

Mathematics Subject Classification ID

Convex programming (90C25)

Cites work

• A modified reduced gradient method for dual posynomial programming
• Convex Analysis
• Geometric programming: Duality in quadratic programming an \(l_{p}\)- approximation III (Degenerate programs)
• Geometric Programming: Duality in Quadratic Programming and l_p -Approximation II (Canonical Programs)
• scientific article; zbMATH DE number 3466802 (Why is no real title available?)
• scientific article; zbMATH DE number 3577030 (Why is no real title available?)
• scientific article; zbMATH DE number 3272827 (Why is no real title available?)
• scientific article; zbMATH DE number 3358258 (Why is no real title available?)
• scientific article; zbMATH DE number 3399051 (Why is no real title available?)
• The Convex Simplex Method

Cited in

(5)

• Reversed geometric programming: A branch-and-bound method involving linear subproblems
• A reduced gradient method for quadratic programs with quadratic constraints and \(l_ p-\)constrained \(l_ p-\)approximation problems
• Economic dispatch of thermal power systems using geometric programming
• Flexible contracting. Theory and case examples
• Reduced subgradient bundle method for linearly constrained non-smooth non-convex problems

This page was built for publication: A modified reduced gradient method for a class of nondifferentiable problems

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