Geodesic convexity on Rn1+

DOI10.1080/02331939608844226zbMath0896.52001OpenAlexW4240617320MaRDI QIDQ4351185

Tamás Rapcsák

Publication date: 8 October 1997

Published in: Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/02331939608844226

zbMATH Keywords

geodesic convexity

Mathematics Subject Classification ID

Axiomatic and generalized convexity (52A01) Convexity of real functions of several variables, generalizations (26B25)

Related Items (2)

Geodesic and contour optimization using conformal mapping ⋮ Convex- and monotone-transformable mathematical programming problems and a proximal-like point method

Cites Work

• Unnamed Item
• Unnamed Item
• Nonlinear coordinate transformations for unconstrained optimization. II: Theoretical background
• Geodesic convexity in nonlinear optimization
• An extension of Karmarkar's algorithm for linear programming using dual variables
• A multiplicative barrier function method for linear programming
• On the convexity of the multiplicative version of Karmarkar's potential function
• Integrability of vector and multivector fields associated with interior point methods for linear programming
• Generalized convexity on affine subspaces with an application to potential functions
• On the connectedness of the solution set to linear complementarity systems
• On the connectedness of the solution set to nonlinear complementarity systems
• Minimum problems on differentiable manifolds
• Convexity along curves and indunvexity
• Criteria for quasi-convexity and pseudo-convexity: Relationships and comparisons

This page was built for publication: Geodesic convexity on Rⁿ¹₊