A Homotopy based approach to unconstrained optimization

DOI10.1080/00036817908839241zbMATH Open0403.90071OpenAlexW2093076206WikidataQ58135535 ScholiaQ58135535MaRDI QIDQ4189062FDOQ4189062

J. P. Dauer, Mordecai Avriel

Publication date: 1979

Published in: Applicable Analysis (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/00036817908839241

zbMATH Keywords

Nonlinear ProgrammingNewton MethodConvergence AnalysisLinear SearchUnconstrained OptimizationLevenberg-Marquardt Type of AlgorithmSteepest Descent Direction

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Nonlinear programming (90C30)

Cites Work

• A new approach to variable metric algorithms
• An Algorithm for Least-Squares Estimation of Nonlinear Parameters
• A method for the solution of certain non-linear problems in least squares
• Title not available (Why is that?)
• On Solving Nonlinear Equations with a One-Parameter Operator Imbedding
• Minimization of functions having Lipschitz continuous first partial derivatives
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• A stable approach to Newton's method for general mathematical programming problems in R\(^n\)
• Title not available (Why is that?)
• A View of Unconstrained Minimization Algorithms that Do Not Require Derivatives
• Title not available (Why is that?)

Cited In (1)

• A new arc algorithm for unconstrained optimization

This page was built for publication: A Homotopy based approach to unconstrained optimization

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4189062)