New Self-Concordant Barrier for the Hypercube
Author
Abstract
Suggested Citation
DOI: 10.1007/s10957-007-9220-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
- O. P. Ferreira & P. R. Oliveira, 1998. "Subgradient Algorithm on Riemannian Manifolds," Journal of Optimization Theory and Applications, Springer, vol. 97(1), pages 93-104, April.
- NESTEROV , Yu. & TODD, Mike, 2002. "On the Riemannian geometry defined by self-concordant barriers and interior-point methods," LIDAM Reprints CORE 1595, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
Citations
Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
Cited by:
- Da Tian, 2014. "An entire space polynomial-time algorithm for linear programming," Journal of Global Optimization, Springer, vol. 58(1), pages 109-135, January.
- G. C. Bento & O. P. Ferreira & P. R. Oliveira, 2012. "Unconstrained Steepest Descent Method for Multicriteria Optimization on Riemannian Manifolds," Journal of Optimization Theory and Applications, Springer, vol. 154(1), pages 88-107, July.
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.- Glaydston C. Bento & Orizon P. Ferreira & Jefferson G. Melo, 2017. "Iteration-Complexity of Gradient, Subgradient and Proximal Point Methods on Riemannian Manifolds," Journal of Optimization Theory and Applications, Springer, vol. 173(2), pages 548-562, May.
- Gregório, R.M. & Oliveira, P.R. & Alves, C.D.S., 2019. "A two-phase-like proximal point algorithm in domains of positivity," Applied Mathematics and Computation, Elsevier, vol. 343(C), pages 67-89.
- G. C. Bento & O. P. Ferreira & P. R. Oliveira, 2012. "Unconstrained Steepest Descent Method for Multicriteria Optimization on Riemannian Manifolds," Journal of Optimization Theory and Applications, Springer, vol. 154(1), pages 88-107, July.
- João Carlos de O. Souza, 2018. "Proximal Point Methods for Lipschitz Functions on Hadamard Manifolds: Scalar and Vectorial Cases," Journal of Optimization Theory and Applications, Springer, vol. 179(3), pages 745-760, December.
- J. X. Cruz Neto & O. P. Ferreira & P. R. Oliveira & R. C. M. Silva, 2008. "Central Paths in Semidefinite Programming, Generalized Proximal-Point Method and Cauchy Trajectories in Riemannian Manifolds," Journal of Optimization Theory and Applications, Springer, vol. 139(2), pages 227-242, November.
- da Silva Alves, Charlan Dellon & Oliveira, Paulo Roberto & Gregório, Ronaldo Malheiros, 2021. "Lα Riemannian weighted centers of mass applied to compose an image filter to diffusion tensor imaging," Applied Mathematics and Computation, Elsevier, vol. 390(C).
- T. Bittencourt & O. P. Ferreira, 2017. "Kantorovich’s theorem on Newton’s method under majorant condition in Riemannian manifolds," Journal of Global Optimization, Springer, vol. 68(2), pages 387-411, June.
- Erik Alex Papa Quiroz & Nancy Baygorrea Cusihuallpa & Nelson Maculan, 2020. "Inexact Proximal Point Methods for Multiobjective Quasiconvex Minimization on Hadamard Manifolds," Journal of Optimization Theory and Applications, Springer, vol. 186(3), pages 879-898, September.
- Glaydston Carvalho Bento & Sandro Dimy Barbosa Bitar & João Xavier Cruz Neto & Paulo Roberto Oliveira & João Carlos Oliveira Souza, 2019. "Computing Riemannian Center of Mass on Hadamard Manifolds," Journal of Optimization Theory and Applications, Springer, vol. 183(3), pages 977-992, December.
- J. X. Cruz Neto & F. M. O. Jacinto & P. A. Soares & J. C. O. Souza, 2018. "On maximal monotonicity of bifunctions on Hadamard manifolds," Journal of Global Optimization, Springer, vol. 72(3), pages 591-601, November.
- Peng Zhang & Gejun Bao, 2018. "An Incremental Subgradient Method on Riemannian Manifolds," Journal of Optimization Theory and Applications, Springer, vol. 176(3), pages 711-727, March.
- Lei Wang & Xin Liu & Yin Zhang, 2023. "A communication-efficient and privacy-aware distributed algorithm for sparse PCA," Computational Optimization and Applications, Springer, vol. 85(3), pages 1033-1072, July.
- X. M. Wang & C. Li & J. C. Yao, 2015. "Subgradient Projection Algorithms for Convex Feasibility on Riemannian Manifolds with Lower Bounded Curvatures," Journal of Optimization Theory and Applications, Springer, vol. 164(1), pages 202-217, January.
- Orizon P. Ferreira & Mauricio S. Louzeiro & Leandro F. Prudente, 2020. "Iteration-Complexity and Asymptotic Analysis of Steepest Descent Method for Multiobjective Optimization on Riemannian Manifolds," Journal of Optimization Theory and Applications, Springer, vol. 184(2), pages 507-533, February.
- 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.
- Guo-ji Tang & Nan-jing Huang, 2012. "Korpelevich’s method for variational inequality problems on Hadamard manifolds," Journal of Global Optimization, Springer, vol. 54(3), pages 493-509, November.
- João S. Andrade & Jurandir de O. Lopes & João Carlos de O. Souza, 2023. "An inertial proximal point method for difference of maximal monotone vector fields in Hadamard manifolds," Journal of Global Optimization, Springer, vol. 85(4), pages 941-968, April.
- Jean-Baptiste Hiriart-Urruty & Jérôme Malick, 2012. "A Fresh Variational-Analysis Look at the Positive Semidefinite Matrices World," Journal of Optimization Theory and Applications, Springer, vol. 153(3), pages 551-577, June.
- 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.
- Teles A. Fernandes & Orizon P. Ferreira & Jinyun Yuan, 2017. "On the Superlinear Convergence of Newton’s Method on Riemannian Manifolds," Journal of Optimization Theory and Applications, Springer, vol. 173(3), pages 828-843, June.
More about this item
Keywords
Interior-point methods; Self-concordant barrier; Newton methods; Geodesic algorithms; Proximal-point algorithms;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:135:y:2007:i:3:d:10.1007_s10957-007-9220-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.