On search directions for minimization algorithms

1973/12/01 by M. J. D. Powell · 20 citations
Computer Science · Mathematics · Engineering · #Optimization and Variational Analysis #Advanced Optimization Algorithms Research #Topology Optimization in Engineering

paper · doi:10.1007/bf01584660

Citations

• An Automatic Method for Finding the Greatest or Least Value of a Function

Cited by

• Optimization Methods for Large-Scale Machine Learning
• Optimization by Direct Search: New Perspectives on Some Classical and Modern Methods
• Topology-aware block coordinate descent for qubit frequency allocation of superconducting quantum processors
• A Hybrid Method of Combinatorial Search and Coordinate Descent for Discrete Optimization
• Coordinate Descent Algorithms
• Disciplined Multi-Convex Programming
• Disciplined Biconvex Programming
• A flexible block-coordinate forward-backward algorithm for non-smooth and non-convex optimization
• Stochastic Subspace Descent
• A Unified Algorithmic Framework for Block-Structured Optimization Involving Big Data: With applications in machine learning and signal processing
• A provably convergent alternating minimization method for mean field\n inference
• Bayesian optimization for modular black-box systems with switching costs
• Nonnegative Factorization and The Maximum Edge Biclique Problem
• Non-Euclidean Broximal Point Method: A Blueprint for Geometry-Aware Optimization
• Beyond Alternating Updates for Matrix Factorization with Inertial Bregman Proximal Gradient Algorithms
• Curiosities and counterexamples in smooth convex optimization
• Decomposition algorithms for generalized potential games
• A Block Decomposition Algorithm for Sparse Optimization
• Efficient random coordinate descent algorithms for large-scale structured nonconvex optimization
• On global convergence of alternating least squares for tensor approximation