scientific article; zbMATH DE number 3356498
From MaRDI portal
Publication:5630864
zbMath0224.90069MaRDI QIDQ5630864
Publication date: 1970
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (66)
A pathsearch damped Newton method for computing general equilibria ⋮ Parallel and sequential Kaczmarz methods for solving underdetermined nonlinear equations ⋮ Restricted simplicial decomposition for convex constrained problems ⋮ Revision of a Derivative-Free Quasi-Newton Method ⋮ A branch and bound algorithm for solving separable convex integer programming problems ⋮ A decomposition approach for global optimum search in QP, NLP and MINLP problems ⋮ On estimating workload in interval branch-and-bound global optimization algorithms ⋮ An interior point algorithm for nonlinear quantile regression ⋮ Iterative linear programming solution of convex programs ⋮ A numerical investigation of rank-two ellipsoid algorithms for nonlinear programming ⋮ Some numerical experience with a globally convergent algorithm for nonlinearly constrained optimization ⋮ On the convergence of a generalized Reduced gradient algorithm for nonlinear programming problems ⋮ CONOPT: A GRG code for large sparse dynamic nonlinear optimization problems ⋮ An efficient curvilinear method for the minimization of a nonlinear function subject to linear inequality constraints ⋮ A two-stage feasible directions algorithm for nonlinear constrained optimization ⋮ Globally convergent version of Robinson's algorithm for general nonlinear programming problems without using derivatives ⋮ A class of differential descent methods for constrained optimization ⋮ A variant of the generalized reduced gradient algorithm for non-linear programming and its applications ⋮ Performance of several nonlinear programming software packages on microcomputers. ⋮ A globally and quadratically convergent algorithm for general nonlinear programming problems ⋮ An algorithm for solving linearly constrained optimization problems ⋮ An alternate implementation of Goldfarb's minimization algorithm ⋮ A least-distance programming procedure for minimization problems under linear constraints ⋮ A comparative performance evaluation of 27 nonlinear programming codes ⋮ On triangulations for computing fixed points ⋮ Numerical experiments with the one-dimensional non-linear simplex search ⋮ A new hybrid algorithm of scatter search and Nelder-Mead algorithms to optimize joint economic lot sizing problem ⋮ Fuzzy Performance Evaluation of Nonlinear Optimization Methods, with Sensitivity Analysis of the Final Scores ⋮ On triangulations for computing fixed points ⋮ Simplicial decomposition in nonlinear programming algorithms ⋮ An ellipsoid algorithm for nonlinear programming ⋮ An exact penalty function for nonlinear programming with inequalities ⋮ Numerical experiments on DFP-method, a powerful function minimization technique ⋮ A new meta-heuristic algorithm for continuous engineering optimization: harmony search theory and practice ⋮ An accelerated multiplier method for nonlinear programming ⋮ Efficiency and implementation of simplicial zero point algorithms ⋮ A robust conjugate-gradient algorithm which minimizes L-functions ⋮ Computational Study of Local Search Methods for a D.C. Optimization Problem with Inequality Constraints ⋮ A gradient projection-multiplier method for nonlinear programming ⋮ Nonlinear programming on a microcomputer ⋮ Comparison of generalized geometric programming algorithms ⋮ Solving geometric programs using GRG: Results and comparisons ⋮ Current state of the art of algorithms and computer software for geometric programming ⋮ Test example for nonlinear programming codes ⋮ A new arc algorithm for unconstrained optimization ⋮ Bibliography on the evaluation of numerical software ⋮ Properties of updating methods for the multipliers in augmented Lagrangians ⋮ A Newton-type curvilinear search method for constrained optimization ⋮ The Topkis-Veinott algorithm for solving nonlinear programs with lower and upper bounded variables ⋮ A first order, exact penalty function algorithm for equality constrained optimization problems ⋮ A derivative-based bracketing scheme for univariate minimization and the conjugate gradient method ⋮ Pseudo-conjugate directions for the solution of the nonlinear unconstrained optimization problem on a parallel computer ⋮ A modified homogeneous algorithm for function minimization ⋮ CGS algorithms for unconstrained minimization of functions ⋮ A feasible conjugate direction method to solve linearly constrained minimization problems ⋮ Iterative determination of parameters for an exact penalty function ⋮ An improved penalty function method for solving constrained parameter optimization problems ⋮ Secant relations versus positive definiteness in quasi-Newton methods ⋮ A conjugate-direction method based on a nonquadratic model ⋮ A variable-metric method using a nonquadratic model ⋮ An algorithm for composite nonsmooth optimization problems ⋮ A primal-dual Newton-type algorithm for geometric programs with equality constraints ⋮ A Class of Accelerated Conjugate Direction Methods for Linearly Constrained Minimization Problems ⋮ Analysis and implementation of a dual algorithm for constrained optimization ⋮ An efficient simplicial algorithm for computing a zero of a convex union of smooth functions ⋮ Geometry of optimality conditions and constraint qualifications
This page was built for publication:
