Optimality Conditions and a Method of Centers for Minimax Fractional Programs with Difference of Convex Functions
Author
Abstract
Suggested Citation
DOI: 10.1007/s10957-020-01738-2
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
- Smail Addoune & Karima Boufi & Ahmed Roubi, 2018. "Proximal Bundle Algorithms for Nonlinearly Constrained Convex Minimax Fractional Programs," Journal of Optimization Theory and Applications, Springer, vol. 179(1), pages 212-239, October.
- H. Boualam & A. Roubi, 2019. "Proximal bundle methods based on approximate subgradients for solving Lagrangian duals of minimax fractional programs," Journal of Global Optimization, Springer, vol. 74(2), pages 255-284, June.
- K. Boufi & A. Roubi, 2017. "Dual method of centers for solving generalized fractional programs," Journal of Global Optimization, Springer, vol. 69(2), pages 387-426, October.
- Le An & Pham Tao, 2005. "The DC (Difference of Convex Functions) Programming and DCA Revisited with DC Models of Real World Nonconvex Optimization Problems," Annals of Operations Research, Springer, vol. 133(1), pages 23-46, January.
- A. Roubi, 2000. "Method of Centers for Generalized Fractional Programming," Journal of Optimization Theory and Applications, Springer, vol. 107(1), pages 123-143, October.
- Jian Lv & Li-Ping Pang & Fan-Yun Meng, 2018. "A proximal bundle method for constrained nonsmooth nonconvex optimization with inexact information," Journal of Global Optimization, Springer, vol. 70(3), pages 517-549, March.
Citations
Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
Cited by:
- Jiao, Hongwei & Li, Binbin, 2022. "Solving min–max linear fractional programs based on image space branch-and-bound scheme," Chaos, Solitons & Fractals, Elsevier, vol. 164(C).
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.- H. Boualam & A. Roubi, 2019. "Proximal bundle methods based on approximate subgradients for solving Lagrangian duals of minimax fractional programs," Journal of Global Optimization, Springer, vol. 74(2), pages 255-284, June.
- Liping Pang & Xiaoliang Wang & Fanyun Meng, 2023. "A proximal bundle method for a class of nonconvex nonsmooth composite optimization problems," Journal of Global Optimization, Springer, vol. 86(3), pages 589-620, July.
- Smail Addoune & Karima Boufi & Ahmed Roubi, 2018. "Proximal Bundle Algorithms for Nonlinearly Constrained Convex Minimax Fractional Programs," Journal of Optimization Theory and Applications, Springer, vol. 179(1), pages 212-239, October.
- J. X. Cruz Neto & P. R. Oliveira & A. Soubeyran & J. C. O. Souza, 2020.
"A generalized proximal linearized algorithm for DC functions with application to the optimal size of the firm problem,"
Annals of Operations Research, Springer, vol. 289(2), pages 313-339, June.
- J. Cruz Neto & P. Oliveira & Antoine Soubeyran & J. Souza, 2020. "A generalized proximal linearized algorithm for DC functions with application to the optimal size of the firm problem," Post-Print hal-01985336, HAL.
- M. Bierlaire & M. Thémans & N. Zufferey, 2010. "A Heuristic for Nonlinear Global Optimization," INFORMS Journal on Computing, INFORMS, vol. 22(1), pages 59-70, February.
- Bai, Jushan & Liao, Yuan, 2016. "Efficient estimation of approximate factor models via penalized maximum likelihood," Journal of Econometrics, Elsevier, vol. 191(1), pages 1-18.
- William Haskell & J. Shanthikumar & Z. Shen, 2013. "Optimization with a class of multivariate integral stochastic order constraints," Annals of Operations Research, Springer, vol. 206(1), pages 147-162, July.
- Jean-Paul Penot, 2011. "The directional subdifferential of the difference of two convex functions," Journal of Global Optimization, Springer, vol. 49(3), pages 505-519, March.
- Tao Pham Dinh & Nam Nguyen Canh & Hoai Le Thi, 2010. "An efficient combined DCA and B&B using DC/SDP relaxation for globally solving binary quadratic programs," Journal of Global Optimization, Springer, vol. 48(4), pages 595-632, December.
- Stefan Sremac & Fei Wang & Henry Wolkowicz & Lucas Pettersson, 2019. "Noisy Euclidean distance matrix completion with a single missing node," Journal of Global Optimization, Springer, vol. 75(4), pages 973-1002, December.
- Xiaoliang Wang & Liping Pang & Qi Wu & Mingkun Zhang, 2021. "An Adaptive Proximal Bundle Method with Inexact Oracles for a Class of Nonconvex and Nonsmooth Composite Optimization," Mathematics, MDPI, vol. 9(8), pages 1-27, April.
- Hoai Le Thi & Tao Pham Dinh, 2011. "On solving Linear Complementarity Problems by DC programming and DCA," Computational Optimization and Applications, Springer, vol. 50(3), pages 507-524, December.
- Hoai An Le Thi & Mahdi Moeini, 2014. "Long-Short Portfolio Optimization Under Cardinality Constraints by Difference of Convex Functions Algorithm," Journal of Optimization Theory and Applications, Springer, vol. 161(1), pages 199-224, April.
- Hoai An Le Thi & Manh Cuong Nguyen, 2017. "DCA based algorithms for feature selection in multi-class support vector machine," Annals of Operations Research, Springer, vol. 249(1), pages 273-300, February.
- Manlio Gaudioso & Giovanni Giallombardo & Giovanna Miglionico, 2023. "Sparse optimization via vector k-norm and DC programming with an application to feature selection for support vector machines," Computational Optimization and Applications, Springer, vol. 86(2), pages 745-766, November.
- Manuel Ruiz & Olivier Briant & Jean-Maurice Clochard & Bernard Penz, 2013. "Large-scale standard pooling problems with constrained pools and fixed demands," Journal of Global Optimization, Springer, vol. 56(3), pages 939-956, July.
- Xiang Zhang & Yichao Wu & Lan Wang & Runze Li, 2016. "Variable selection for support vector machines in moderately high dimensions," Journal of the Royal Statistical Society Series B, Royal Statistical Society, vol. 78(1), pages 53-76, January.
- Manlio Gaudioso & Giovanni Giallombardo & Giovanna Miglionico, 2015. "Optimal Replenishment Order Placement in a Finite Time Horizon," Journal of Optimization Theory and Applications, Springer, vol. 164(3), pages 1078-1089, March.
- Lin Zhang & Andrew DiLernia & Karina Quevedo & Jazmin Camchong & Kelvin Lim & Wei Pan, 2021. "A random covariance model for bi‐level graphical modeling with application to resting‐state fMRI data," Biometrics, The International Biometric Society, vol. 77(4), pages 1385-1396, December.
- Strekalovsky, Alexander S., 2015. "On local search in d.c. optimization problems," Applied Mathematics and Computation, Elsevier, vol. 255(C), pages 73-83.
More about this item
Keywords
Fractional programming; Difference of convex functions; Optimality conditions; Method of centers;All these keywords.
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:joptap:v:187:y:2020:i:1:d:10.1007_s10957-020-01738-2. 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.