A modified reduced gradient method for a class of nondifferentiable problems

DOI10.1007/BF01581637zbMATH Open0454.90058OpenAlexW2010003095MaRDI QIDQ3902833FDOQ3902833

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

convergencenondifferentiable optimizationdual problemprimal problemfaithfully convex functionsmodified reduced gradient method

Mathematics Subject Classification ID

Convex programming (90C25)

Cites Work

• Convex Analysis
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• The Convex Simplex Method
• 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)
• A modified reduced gradient method for dual posynomial programming
• Title not available (Why is that?)

Cited In (5)

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

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)