An efficient one—dimensional search procedure for barrier functions
From MaRDI portal
Publication:5675156
DOI10.1007/BF01584671zbMath0259.90041OpenAlexW1969487360MaRDI QIDQ5675156
L. S. Lasdon, Margery W. Ratner, Richard L. Fox
Publication date: 1973
Published in: Mathematical Programming (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf01584671
Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) Search theory (90B40)
Related Items (3)
Interpolation methods in one dimensional optimization ⋮ Optimum design of stiffened structures with constraint on the frequency in the presence of initial stresses ⋮ Synthesis of waffle plates in the post buckled domain
Cites Work
- A Rapidly Convergent Descent Method for Minimization
- An efficient method for finding the minimum of a function of several variables without calculating derivatives
- Variable metric methods of minimisation
- Solution for Turbulent Correlations Using Multipoint Distribution Functions
- An efficient algorithm for minimizing barrier and penalty functions
- Unnamed Item
- Unnamed Item
This page was built for publication: An efficient one—dimensional search procedure for barrier functions
