scientific article; zbMATH DE number 3356498

Cited in

(66)

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
Parallel and sequential Kaczmarz methods for solving underdetermined nonlinear equations
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
An efficient curvilinear method for the minimization of a nonlinear function subject to linear inequality constraints
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
A globally and quadratically convergent algorithm for general nonlinear programming problems
A least-distance programming procedure for minimization problems under linear constraints
A comparative performance evaluation of 27 nonlinear programming codes
Numerical experiments with the one-dimensional non-linear simplex search
Numerical experiments on DFP-method, a powerful function minimization technique
An accelerated multiplier method for nonlinear programming
A robust conjugate-gradient algorithm which minimizes L-functions
A gradient projection-multiplier method for nonlinear programming
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
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
Analysis and implementation of a dual algorithm for constrained optimization
A branch and bound algorithm for solving separable convex integer programming problems
Performance of several nonlinear programming software packages on microcomputers.
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
An interior point algorithm for nonlinear quantile regression
A pathsearch damped Newton method for computing general equilibria
Restricted simplicial decomposition for convex constrained problems
On estimating workload in interval branch-and-bound global optimization algorithms
A new meta-heuristic algorithm for continuous engineering optimization: harmony search theory and practice
A decomposition approach for global optimum search in QP, NLP and MINLP problems
An ellipsoid algorithm for nonlinear programming
CONOPT: A GRG code for large sparse dynamic nonlinear optimization problems
On the convergence of a generalized Reduced gradient algorithm for nonlinear programming problems
A two-stage feasible directions algorithm for nonlinear constrained optimization
Fuzzy Performance Evaluation of Nonlinear Optimization Methods, with Sensitivity Analysis of the Final Scores
An efficient simplicial algorithm for computing a zero of a convex union of smooth functions
An alternate implementation of Goldfarb's minimization algorithm
On triangulations for computing fixed points
A Class of Accelerated Conjugate Direction Methods for Linearly Constrained Minimization Problems
On triangulations for computing fixed points
Simplicial decomposition in nonlinear programming algorithms
Revision of a Derivative-Free Quasi-Newton Method
A new arc algorithm for unconstrained optimization
A first order, exact penalty function algorithm for equality constrained optimization problems
An exact penalty function for nonlinear programming with inequalities
Geometry of optimality conditions and constraint qualifications
A new hybrid algorithm of scatter search and Nelder-Mead algorithms to optimize joint economic lot sizing problem
Efficiency and implementation of simplicial zero point algorithms
An algorithm for solving linearly constrained optimization problems
Nonlinear programming on a microcomputer
Computational Study of Local Search Methods for a D.C. Optimization Problem with Inequality Constraints
Secant relations versus positive definiteness in quasi-Newton methods

This page was built for publication:

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