Optimization by Least Squares

DOI10.1137/0705006zbMath0165.50304OpenAlexW2078539916MaRDI QIDQ5551868

David D. Morrison

Publication date: 1968

Published in: SIAM Journal on Numerical Analysis (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/0705006

zbMATH Keywords

numerical analysis

Related Items (23)

An exact penalty function based on the projection matrix ⋮ A Smoothing Objective Penalty Function Algorithm for Inequality Constrained Optimization Problems ⋮ An M-objective penalty function algorithm under big penalty parameters ⋮ Exactness and algorithm of an objective penalty function ⋮ Least squares with non-linear equality constraints. Application to closing of balances ⋮ Penalty function versus non-penalty function methods for constrained nonlinear programming problems ⋮ Least square approach for system reliability optimization† ⋮ Hybrid computation in mathematical programming ⋮ A globally convergent neurodynamics optimization model for mathematical programming with equilibrium constraints ⋮ A computational comparison of some non-linear programs ⋮ An algorithm for convex constrained minimax optimization based on duality ⋮ Reliability optimization through sequential simplex search ⋮ An objective penalty function-based method for inequality constrained minimization problem ⋮ A new objective penalty function approach for solving constrained minimax problems ⋮ Second-Order Smoothing Objective Penalty Function for Constrained Optimization Problems ⋮ A generalized Lagrangian function and multiplier method ⋮ Optimization of electrical circuits ⋮ New algorithms for constrained minimax optimization ⋮ Minimization methods with constraints ⋮ Approximation methods for the unconstrained optimization ⋮ Augmented Lagrangian Objective Penalty Function ⋮ An objective penalty function method for biconvex programming ⋮ Smoothing Approximation to the New Exact Penalty Function with Two Parameters

This page was built for publication: Optimization by Least Squares