The Variable Reduction Method for Nonlinear Programming
From MaRDI portal
Publication:5609872
DOI10.1287/mnsc.17.3.146zbMath0209.22803MaRDI QIDQ5609872
Publication date: 1970
Published in: Management Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/mnsc.17.3.146
90C30: Nonlinear programming
Related Items
An efficient algorithm for minimizing barrier and penalty functions, Approximating saddle points as equilibria of differential inclusions, Global optimization algorithms for linearly constrained indefinite quadratic problems, Algoritmo risolutivo per una classe particolare di problemi di minimo vincolato, An algorithm for linearly constrained nonlinear programming problems, Error analysis for convex separable programs: Bounds on optimal and dual optimal solutions, An accelerated conjugate direction method to solve linearly constrained minimization problems, A Newton-type univariate optimization algorithm for locating the nearest extremum, The if-problem in automatic differentiation, A new linesearch method for quadratically constrained convex programming, Bayesian evidence test for precise hypotheses, Converting general nonlinear programming problems into separable programming problems with feedforward neural networks., Soft variable-structure controls: a survey, Large-scale linearly constrained optimization
