Nonlinear coordinate transformations for unconstrained optimization. II: Theoretical background
From MaRDI portal
Publication:686997
DOI10.1007/BF01096776zbMATH Open0812.90137MaRDI QIDQ686997FDOQ686997
Publication date: 13 October 1993
Published in: Journal of Global Optimization (Search for Journal in Brave)
geodesic convexityunimodal functionglobal unconstrained optimizationnonlinear coordinate transformationssmooth unconstrained optimization
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Generalized arcwise-connected functions and characterizations of local- global minimum properties
- Tensor Methods for Nonlinear Equations
- The Gradient Projection Method Along Geodesics
- An analytical approach to global optimization
- On generalized means and generalized convex functions
- Minimizing a differentiable function over a differential manifold
- A note on functions whose local minima are global
- Tensor Methods for Unconstrained Optimization Using Second Derivatives
- Elementary properties of arcwise connected sets and functions
- A topological property of limes-arcwise strictly quasiconvex functions
- Connected level sets, minimizing sets and uniqueness in optimization
- Integrability of vector and multivector fields associated with interior point methods for linear programming
- Experiments using interval analysis for solving a circuit design problem
- Global optimization in arcwise connected metric spaces
- Generalized connectedness for families of Arcs
- Minimum problems on differentiable manifolds
- Automatic Categorization of Optimization Problems: An Application of Computer Symbolic Mathematics
Cited In (8)
- ITERATIVE GEOMETRIC STRUCTURES
- Nonlinear coordinate representations of smooth optimization problems
- Riemannian Newton method for positive bounded Hessian functions
- Nonlinear transformations for the simplification of unconstrained nonlinear optimization problems
- On a class of direct optimization problems
- Efficient interval partitioning for constrained global optimization
- Geodesic convexity on Rn1+
- Nonlinear Symbolic Transformations for Simplifying Optimization Problems
Recommendations
- Nonlinear coordinate transformations for unconstrained optimization. I: Basic transformations 👍 👎
- Nonlinear Symbolic Transformations for Simplifying Optimization Problems 👍 👎
- Nonlinear transformations for the simplification of unconstrained nonlinear optimization problems 👍 👎
- Nonlinear coordinate representations of smooth optimization problems 👍 👎
- Title not available (Why is that?) 👍 👎
This page was built for publication: Nonlinear coordinate transformations for unconstrained optimization. II: Theoretical background
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q686997)