On search directions for minimization algorithms

1973/12/01 by M. J. D. Powell · 327 citations
Computer Science · Engineering · Mathematics · #Advanced Optimization Algorithms Research #Algorithm #Bounded function #Computer science #Convergence (economics) #Differentiable function #Function (biology) #Mathematical analysis #Mathematical optimization #Mathematics #Minification #Optimization and Variational Analysis #Path (computing) #Property (philosophy) #Sequence (biology) #Topology Optimization in Engineering

paper · doi:10.1007/bf01584660

published in Mathematical Programming 4(1), 193-201 (Springer Science+Business Media)

openalex publication_date 1973/12/01 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/23

Citations

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

Cited by

• 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 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
• Adaptive and Safe Bayesian Optimization in High Dimensions via One-Dimensional Subspaces
• Optimization Methods for Large-Scale Machine Learning
• Understanding Limitation of Two Symmetrized Orders by Worst-case Complexity
• Tightening Fractional Covering Upper Bounds on the Partition Function for High-Order Region Graphs
• Inertial Block Proximal Methods for Non-Convex Non-Smooth Optimization
• Improved Iteration Complexity Bounds of Cyclic Block Coordinate Descent for Convex Problems
• Some Convergence Results on the Regularized Alternating Least-Squares Method for Tensor Decomposition
• On the Wasserstein Geodesic Principal Component Analysis of probability measures
• Learning Low-Complexity Autoregressive Models via Proximal Alternating Minimization
• A Primer on Coordinate Descent Algorithms
• Worst-case Complexity of Cyclic Coordinate Descent: O(n²) Gap with Randomized Version
• High-Throughput Secondary Screening at the Single-Cell Level
• Projected Gradient Methods for Nonnegative Matrix Factorization
• Superfast Line Spectral Estimation
• Effect of STAT3 inhibitor in chronic myeloid leukemia associated signaling pathway: a mathematical modeling, simulation and systems biology study. [europepmc]
• Monitoring of PM 2.5 Concentrations by Learning from Multi-Weather Sensors. [europepmc]
• Design and Modelling of a Continuum Robot for Distal Lung Sampling in Mechanically Ventilated Patients in Critical Care. [europepmc]
• Mitigating Environmental Impact Through the Use of Rice Husk Ash in Sustainable Concrete: Experimental Study, Numerical Modelling, and Optimisation. [europepmc]