IDEAS home Printed from https://ideas.repec.org/p/ems/eureir/1376.html
   My bibliography  Save this paper

An interior point subgradient method for linearly constrained nondifferentiable convex programming

Author

Listed:
  • Frenk, J.B.G.
  • Sturm, J.F.
  • Zhang, S.

Abstract

We propose in this paper an algorithm for solving linearly constrained nondifferentiable convex programming problems. This algorithm combines the ideas of the affine scaling method with the subgradient method. It is a generalization of the dual and interior point method for min-max problems proposed by Sturm and Zhang [J.F. Sturm and S. Zhang, A dual and interior point approach to solve convex min-max problems, in: D.-Z. Du and P.M. Pardalos eds., Minimax and Applications, (1995) 69-78, Kluwer]. In the new method, the search direction is obtained by projecting in a scaled space a subgradient of the objective function with a logarithmic barrier term. The stepsize choice is analogous to the stepsize choice in the usual subgradient method. Convergence of the method is established.

Suggested Citation

  • Frenk, J.B.G. & Sturm, J.F. & Zhang, S., 1996. "An interior point subgradient method for linearly constrained nondifferentiable convex programming," Econometric Institute Research Papers EI 9612-/A, Erasmus University Rotterdam, Erasmus School of Economics (ESE), Econometric Institute.
    • Handle: RePEc:ems:eureir:1376
    as

    Download full text from publisher

    To our knowledge, this item is not available for download. To find whether it is available, there are three options:
    1. Check below whether another version of this item is available online.
    2. Check on the provider's web page whether it is in fact available.
    3. Perform a search for a similarly titled item that would be available.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:ems:eureir:1376. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: RePub (email available below). General contact details of provider: https://edirc.repec.org/data/feeurnl.html .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.