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 J.F. Sturm and S. Zhang (1995), A dual and interior point approach to solve convex min–max problems, in D.-Z. Du and P.M. Pardalos (eds.)Minimax and Applications, pp. 69-78, Kluwer Academic Publishers. 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.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
