On the Riemannian geometry defined by self-concordant barriers and interior-point methods.

From MaRDI portal
Revision as of 11:41, 1 February 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:1865823

DOI10.1007/S102080010032zbMath1049.90127OpenAlexW2154059477WikidataQ115385168 ScholiaQ115385168MaRDI QIDQ1865823

Michael J. Todd, Yu. E. Nesterov

Publication date: 23 June 2003

Published in: Foundations of Computational Mathematics (Search for Journal in Brave)

Full work available at URL: https://hdl.handle.net/1813/9170




Related Items (59)

Proximal subgradient and a characterization of Lipschitz function on Riemannian manifoldsConvexity with respect to a differential equationIteration-complexity of gradient, subgradient and proximal point methods on Riemannian manifoldsTseng's methods for inclusion problems on Hadamard manifoldsHessian distances and their applications in the complexity analysis of interior-point methodsFull convergence of the proximal point method for quasiconvex functions on Hadamard manifoldsEnlargement of monotone vector fields and an inexact proximal point method for variational inequalities in Hadamard manifoldsAn extragradient method for non-monotone equilibrium problems on Hadamard manifolds with applicationsGeodesic Walks in PolytopesIterative algorithms for monotone variational inequality and fixed point problems on Hadamard manifoldsEfficient rank reduction of correlation matricesKantorovich's theorem on Newton's method under majorant condition in Riemannian manifoldsOn the superlinear convergence of Newton's method on Riemannian manifoldsThe resolvent average on symmetric conesLinear optimization over homogeneous matrix conesA modified proximal point method for DC functions on Hadamard manifoldsA Geodesic Interior-Point Method for Linear Optimization over Symmetric ConesInexact proximal point methods for multiobjective quasiconvex minimization on Hadamard manifoldsA binomial expansion formula for weighted geometric means of unipotent matricesA class of primal affine scaling algorithmsImage labeling by assignmentAn inertial proximal point method for difference of maximal monotone vector fields in Hadamard manifoldsA fresh variational-analysis look at the positive semidefinite matrices worldProximal point method for minimizing quasiconvex locally Lipschitz functions on Hadamard manifoldsThe Derivative of the Matrix Geometric Mean with an Application to the Nonnegative Decomposition of Tensor GridsIteration-complexity of the subgradient method on Riemannian manifolds with lower bounded curvatureThe Karcher mean of linearly independent triplesSelf-Assignment Flows for Unsupervised Data Labeling on GraphsFirst Order Methods for Optimization on Riemannian ManifoldsSelf-concordant functions for optimization on smooth manifoldsParabolic target space and primal-dual interior-point methodsLegendre transform and applications to finite and infinite optimizationCentral Path Curvature and Iteration-Complexity for Redundant Klee—Minty CubesSteepest descent method with a generalized Armijo search for quasiconvex functions on Riemannian manifoldsGolden-Hessian structuresNew self-concordant barrier for the hypercubeUnconstrained steepest descent method for multicriteria optimization on Riemannian manifoldsA two-phase-like proximal point algorithm in domains of positivity``Cone-free primal-dual path-following and potential-reduction polynomial time interior-point methodsInvariant tolerance relations on positive definite matricesComputing Riemannian center of mass on Hadamard manifoldsConvex- and monotone-transformable mathematical programming problems and a proximal-like point methodRiemannian Newton method for positive bounded Hessian functionsITERATIVE GEOMETRIC STRUCTURESNonhomogeneous Karcher equations with vector fields on positive definite matricesCentral paths in semidefinite programming, generalized proximal-point method and Cauchy trajectories in Riemannian manifoldsIteration-complexity and asymptotic analysis of steepest descent method for multiobjective optimization on Riemannian manifoldsComplexity of Bezout's theorem. VI: Geodesics in the condition (number) metricProximal point algorithm with Schur decomposition on the cone of symmetric semidefinite positive matricesProximal point method for a special class of nonconvex functions on Hadamard manifoldsOnline Discrete Optimization in Social Networks in the Presence of Knightian UncertaintyPrimal central paths and Riemannian distances for convex setsIterative algorithm for singularities of inclusion problems in Hadamard manifoldsGradient Method for Optimization on Riemannian Manifolds with Lower Bounded CurvatureGeometries on the cone of positive-definite matrices derived from the power potential and their relation to the power meansUnnamed ItemProximal Point Algorithms on Hadamard Manifolds: Linear Convergence and Finite TerminationUnnamed ItemRandomized interior point methods for sampling and optimization







This page was built for publication: On the Riemannian geometry defined by self-concordant barriers and interior-point methods.