Interior Epigraph Directions method for nonsmooth and nonconvex optimization via generalized augmented Lagrangian duality
Author
Abstract
Suggested Citation
DOI: 10.1007/s10898-013-0108-4
Download full text from publisher
As the access to this document is restricted, you may want to search for a different version of it.
References listed on IDEAS
- Regina Burachik & Alfredo Iusem & Jefferson Melo, 2010. "A primal dual modified subgradient algorithm with sharp Lagrangian," Journal of Global Optimization, Springer, vol. 46(3), pages 347-361, March.
- Regina S. Burachik & C. Yalçın Kaya, 2010. "A Deflected Subgradient Method Using a General Augmented Lagrangian Duality with Implications on Penalty Methods," Springer Optimization and Its Applications, in: Regina S. Burachik & Jen-Chih Yao (ed.), Variational Analysis and Generalized Differentiation in Optimization and Control, pages 109-132, Springer.
- R. S. Burachik & A. N. Iusem & J. G. Melo, 2010. "Duality and Exact Penalization for General Augmented Lagrangians," Journal of Optimization Theory and Applications, Springer, vol. 147(1), pages 125-140, October.
- Regina Burachik & C. Kaya & Musa Mammadov, 2010. "An inexact modified subgradient algorithm for nonconvex optimization," Computational Optimization and Applications, Springer, vol. 45(1), pages 1-24, January.
Most related items
These are the items that most often cite the same works as this one and are cited by the same works as this one.- Regina S. Burachik & Alfredo N. Iusem & Jefferson G. Melo, 2013. "An Inexact Modified Subgradient Algorithm for Primal-Dual Problems via Augmented Lagrangians," Journal of Optimization Theory and Applications, Springer, vol. 157(1), pages 108-131, April.
- L. F. Bueno & G. Haeser & J. M. Martínez, 2015. "A Flexible Inexact-Restoration Method for Constrained Optimization," Journal of Optimization Theory and Applications, Springer, vol. 165(1), pages 188-208, April.
- M. V. Dolgopolik, 2018. "Augmented Lagrangian functions for cone constrained optimization: the existence of global saddle points and exact penalty property," Journal of Global Optimization, Springer, vol. 71(2), pages 237-296, June.
- Henri Bonnel & C. Yalçın Kaya, 2010. "Optimization Over the Efficient Set of Multi-objective Convex Optimal Control Problems," Journal of Optimization Theory and Applications, Springer, vol. 147(1), pages 93-112, October.
- Glaydston C. Bento & Jefferson G. Melo, 2012. "Subgradient Method for Convex Feasibility on Riemannian Manifolds," Journal of Optimization Theory and Applications, Springer, vol. 152(3), pages 773-785, March.
- Changyu Wang & Qian Liu & Biao Qu, 2017. "Global saddle points of nonlinear augmented Lagrangian functions," Journal of Global Optimization, Springer, vol. 68(1), pages 125-146, May.
- G. C. Bento & J. X. Cruz Neto, 2013. "A Subgradient Method for Multiobjective Optimization on Riemannian Manifolds," Journal of Optimization Theory and Applications, Springer, vol. 159(1), pages 125-137, October.
- M. Gonçalves & J. Melo & L. Prudente, 2015. "Augmented Lagrangian methods for nonlinear programming with possible infeasibility," Journal of Global Optimization, Springer, vol. 63(2), pages 297-318, October.
- Yu Zhou & Jin Zhou & Xiao Yang, 2014. "Existence of augmented Lagrange multipliers for cone constrained optimization problems," Journal of Global Optimization, Springer, vol. 58(2), pages 243-260, February.
- A. J. Zaslavski, 2014. "An Approximate Exact Penalty in Constrained Vector Optimization on Metric Spaces," Journal of Optimization Theory and Applications, Springer, vol. 162(2), pages 649-664, August.
- Y. Zhou & X. Yang, 2012. "Augmented Lagrangian functions for constrained optimization problems," Journal of Global Optimization, Springer, vol. 52(1), pages 95-108, January.
- C. Y. Wang & X. Q. Yang & X. M. Yang, 2013. "Nonlinear Augmented Lagrangian and Duality Theory," Mathematics of Operations Research, INFORMS, vol. 38(4), pages 740-760, November.
More about this item
Keywords
Nonsmooth optimization; Nonconvex optimization; Augmented Lagrangian duality; Deflected Subgradient method; Nonsmooth Feasible Directions Algorithm; Kissing Number Problem; 90C26; 49M29; 49M37; 90C90;All these keywords.
JEL classification:
Statistics
Access and download statisticsCorrections
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:spr:jglopt:v:60:y:2014:i:3:p:501-529. 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.
If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with 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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .
Please note that corrections may take a couple of weeks to filter through the various RePEc services.