Nonlinear coordinate representations of smooth optimization problems

DOI10.1007/BF02192090zbMath0838.90113OpenAlexW2050428700WikidataQ126004833 ScholiaQ126004833MaRDI QIDQ1905043

T. T. Thang, Tamás Rapcsák

Publication date: 16 January 1996

Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf02192090

zbMATH Keywords

Riemannian metricimage spacevariable metric algorithmsnonlinear coordiante representations of smooth optimization problemright inverses of matrices

Mathematics Subject Classification ID

Nonlinear programming (90C30)

Related Items (4)

Riemannian optimization and multidisciplinary design optimization ⋮ Globally convergent optimization algorithms on Riemannian manifolds: Uniform framework for unconstrained and constrained optimization ⋮ Subgradient algorithm on Riemannian manifolds ⋮ A class of polynomial variable metric algorithms for linear optimization

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Nonlinear coordinate transformations for unconstrained optimization. II: Theoretical background
• A new polynomial-time algorithm for linear programming
• Theorems of the alternative for multifunctions with applications to optimization: General results
• Semidifferentiable functions and necessary optimality conditions
• A multiplicative barrier function method for linear programming
• Minimizing a differentiable function over a differential manifold
• Interior-point methods for convex programming
• On generalized means and generalized convex functions
• A geometric method in nonlinear programming
• On the classical logarithmic barrier function method for a class of smooth convex programming problems
• Polynomial affine algorithms for linear programming
• A class of polynomial variable metric algorithms for linear optimization
• Theorems of the alternative and optimality conditions
• Methods of matrix algebra
• On projected newton barrier methods for linear programming and an equivalence to Karmarkar’s projective method
• The Nonlinear Geometry of Linear Programming. I Affine and Projective Scaling Trajectories
• The Nonlinear Geometry of Linear Programming. II Legendre Transform Coordinates and Central Trajectories
• Minimum problems on differentiable manifolds
• A differential equation approach to nonlinear programming
• A General Quadratic Programming Algorithm
• The Gradient Projection Method Along Geodesics

This page was built for publication: Nonlinear coordinate representations of smooth optimization problems