Direct search methods on reductive homogeneous spaces

DOI10.1007/s10957-018-1225-5OpenAlexW2962848233MaRDI QIDQ1752640

David W. Dreisigmeyer

Publication date: 24 May 2018

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

Full work available at URL: https://arxiv.org/abs/1705.07428

zbMATH Keywords

manifoldnonlinear optimizationdirect search method

Mathematics Subject Classification ID

Derivative-free methods and methods using generalized derivatives (90C56) Numerical optimization and variational techniques (65K10)

Related Items (2)

Tracking and Regret Bounds for Online Zeroth-Order Euclidean and Riemannian Optimization ⋮ Regularizing Orientation Estimation in Cryogenic Electron Microscopy Three-Dimensional Map Refinement through Measure-Based Lifting over Riemannian Manifolds

Uses Software

• OrthoMADS

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• How to generate random matrices from the classical compact groups
• Linear equalities in blackbox optimization
• Direct search methods for nonlinearly constrained optimization using filters and frames
• A Riemannian framework for tensor computing
• A Globally Convergent Augmented Lagrangian Algorithm for Optimization with General Constraints and Simple Bounds
• The Subgroup Algorithm for Generating Uniform Random Variables
• OrthoMADS: A Deterministic MADS Instance with Orthogonal Directions
• The Efficient Generation of Random Orthogonal Matrices with an Application to Condition Estimators
• The Geometry of Algorithms with Orthogonality Constraints
• Frames and Grids in Unconstrained and Linearly Constrained Optimization: A Nonsmooth Approach
• A Pattern Search Filter Method for Nonlinear Programming without Derivatives
• A Globally Convergent Augmented Lagrangian Pattern Search Algorithm for Optimization with General Constraints and Simple Bounds
• A Progressive Barrier for Derivative-Free Nonlinear Programming
• Naive Lie Theory
• Mesh Adaptive Direct Search Algorithms for Constrained Optimization
• Direct Search Based on Probabilistic Descent
• Frame based methods for unconstrained optimization
• Nonlinear programming without a penalty function.

This page was built for publication: Direct search methods on reductive homogeneous spaces