Newton-type methods for unconstrained and linearly constrained optimization

DOI10.1007/BF01585529zbMath0297.90082MaRDI QIDQ4051917

Walter Murray, Philip E. Gill

Publication date: 1974

Published in: Mathematical Programming (Search for Journal in Brave)

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) Newton-type methods (49M15)

Related Items

A derivative-free affine scaling trust region methods based on probabilistic models with new nonmonotone line search technique for linear inequality constrained minimization without strict complementarity, Construction of a Minimum Energy Path for the VT Flash Model by the String Method Coupled with the Exponential Time Differencing Scheme, Unnamed Item, A hybrid HS-LS conjugate gradient algorithm for unconstrained optimization with applications in motion control and image recovery, Interior point methods for large-scale nonlinear programming, Trust-region interior-point method for large sparsel₁optimization, Global convergence technique for the Newton method with periodic Hessian evaluation, Large-Scale Optimization with Linear Equality Constraints Using Reduced Compact Representation, On the superlinear convergence of a trust region algorithm for nonsmooth optimization, Efficient tridiagonal preconditioner for the matrix-free truncated Newton method, Inexact trust region method for large sparse systems of nonlinear equations, Nonlinear programming via an exact penalty function: Global analysis, Nonlinear programming via an exact penalty function: Asymptotic analysis, A hybrid algorithm for solving convex separable network flow problems, Unnamed Item, Unnamed Item, Unnamed Item, A truncated Newton optimization algorithm in meteorology applications with analytic Hessian/vector products, A truncated Newton method with non-monotone line search for unconstrained optimization, Further insight into the Shamanskii modification of Newton method, A method of optimal scaling for multivariate ordinal data and its extensions, On the use of a modified Newton method for nonlinear finite element analysis, Geometric properties of 2D and 3D unilateral large slip contact operators, Computational experience with penalty-barrier methods for nonlinear programming, Insights into the interior-point methods, Second order algorithms for the posynomial geometric programming dual, part I: Analysis, Hybrid methods for large sparse nonlinear least squares, An extension of Karmarkar's projective algorithm for convex quadratic programming, Using improved directions of negative curvature for the solution of bound-constrained nonconvex problems, Finding second-order stationary points in constrained minimization: a feasible direction approach, First-order methods almost always avoid strict saddle points, A practical factorization of a Schur complement for PDE-constrained distributed optimal control, Unnamed Item, Minimizing a differentiable function over a differential manifold, An algorithm for linearly constrained nonlinear programming problems, Modified Cholesky Riemann manifold Hamiltonian Monte Carlo: exploiting sparsity for fast sampling of high-dimensional targets, A modified Newton's method for minimizing factorable functions, Truncated-Newton training algorithm for neurocomputational viscoplastic model., Analysis of preconditioners for conjugate gradients through distribution of eigenvalues, An improved variable penalty algorithm for automated structural design, A comparative performance evaluation of 27 nonlinear programming codes, Avoiding Modified Matrix Factorizations in Newton-like Methods, Factorized quasi-Newton methods for nonlinear least squares problems, Numerical algorithms for solving nonlinearL_р-norm estimation problems: part II - a mixture method for large residual and illo-conditioned problems, Unnamed Item, Partitioned quasi-Newton methods for nonlinear equality constrained optimization, A superlinearly convergent algorithm for minimization without evaluating derivatives, On fast trust region methods for quadratic models with linear constraints, Development of a data assimilation algorithm, Modified Cholesky algorithms: A catalog with new approaches, Pivoting strategy for rank-one modification of \(LDM^ t\)-like factorization, Some algorithms for the convex quadratic programming problem via the ABS approacxh, A quadratically convergent method for minimizing a sum of euclidean norms, An algorithm for linearly constrained programs with a partly linear objective function, Optimization of unconstrained functions with sparse hessian matrices-newton-type methods, A note on the computation of an orthonormal basis for the null space of a matrix, Convergence analysis of truncated incomplete Hessian Newton minimization method and application in biomolecular potential energy minimization, Nonconvex optimization using negative curvature within a modified linesearch, A comparison of some algorithms for the nonlinear least squares problem, Combining and scaling descent and negative curvature directions, The order-restricted association model: two estimation algorithms and issues in testing, Superlinearly convergent variable metric algorithms for general nonlinear programming problems, An algorithm for nonlinear optimization problems with binary variables, The computation of Lagrange-multiplier estimates for constrained minimization, A modification of Armijo's step-size rule for negative curvature, Unnamed Item, Numerically stable methods for quadratic programming, A class on nonmonotone stabilization methods in unconstrained optimization, Globally convergent homotopy methods: A tutorial, Block truncated-Newton methods for parallel optimization, The indefinite zero-one quadratic problem, Interference Alignment and Degrees of Freedom of the $K$-User Interference Channel, A numerically stable and efficient technique for the maintenance of positive definiteness in the Hessian for Newton-type methods, Large-scale linearly constrained optimization, Delaunay-based derivative-free optimization via global surrogates. I: Linear constraints, Delaunay-based derivative-free optimization via global surrogates. II: Convex constraints, Extended iterative methods for the solution of operator equations, Optimization over the efficient set using an active constraint approach, Some numerical methods for limit analysis in continuum mechanics, Unnamed Item, Modélisation géométrique de la faisabilité de plusieurs mélanges, An algorithm for minimizing a differentiable function subject to box constraints and errors, Bibliography on the evaluation of numerical software, Parallel proximal method of solving split system of fixed point set constraint minimization problems, Generating conjugate directions without line searches using factorized variable metric updating formulas, On the use of directions of negative curvature in a modified newton method, A unified approach to structural weight minimization, Some simplified algorithms for the bayesian identification of aircraft parameters, Incremental multiple hidden layers regularized extreme learning machine based on forced positive-definite Cholesky factorization, A globally and quadratically convergent algorithm with efficient implementation for unconstrained optimization, Optimal simultaneous maximuma posterioriestimation of states, noise statistics and parameters I. Algorithm, Optimal simultaneous maximuma posterioriestimation of states, noise statistics and parameters II. Numerical performance, A computational study of active set strategies in nonlinear programming with linear constraints, Adaptive Step Size Selection for Hessian-Based Manifold Langevin Samplers, Nonmonotone curvilinear line search methods for unconstrained optimization, Improving directions of negative curvature in an efficient manner, Finding a Hamiltonian cycle by finding the global minimizer of a linearly constrained problem, Unnamed Item, Unnamed Item, A bundle-Newton method for nonsmooth unconstrained minimization, A least squares algorithm for a mixture model for compositional data., Variable metric methods for linearly constrained nonlinear minimax approximation, A discrete Newton algorithm for minimizing a function of many variables, Linearly constrained pseudo-Newton method, Procedures for optimization problems with a mixture of bounds and general linear constraints, A mathematical model and numerical method for studying platelet adhesion and aggregation during blood clotting, Interior-point algorithms for global optimization, On the globalization of Wilson-type optimization methods by means of generalized reduced gradient methods

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Symmetric decomposition of a positive definite matrix
• Handbook series linear algebra. Linear least squares solutions by Householder transformations
• An effective algorithm for minimization
• Derivative free analogues of the Levenberg-Marquardt and Gauss algorithms for nonlinear least squares approximation
• A numerically stable form of the simplex algorithm
• Methods for Modifying Matrix Factorizations
• On the Relative Efficiencies of Gradient Methods
• On the Numerical Solution of Constrained Least-Squares Problems
• A comparison of modified Newton methods for unconstrained optimisation
• Quasi-Newton Methods for Unconstrained Optimization