Results 231 to 240 of about 13,012,379 (283)

A notation for non-linear program edits

2014 IEEE Symposium on Visual Languages and Human-Centric Computing (VL/HCC), 2014
We present a visual notation to support the understanding and reasoning about program edits. The graph-based representation directly supports a number of editing operations beyond those offered by a typical, linear program-edit model and makes obvious otherwise hidden states the code can reach through selectively undoing or redoing changes.
Martin Erwig, Karl Smeltzer, Keying Xu
openaire   +1 more source

Projection methods for non-linear programming

Mathematical Programming, 1973
Several algorithms are presented for solving the non-linear programming problem, based on “variable-metric” projections of the gradient of the objective function into a local approximation to the constraints. The algorithms differ in the nature of this approximation.
R. W. H. Sargent, Bruce A. Murtagh
openaire   +2 more sources

Non-Linear Programming—A Survey

Management Science, 1963
Some of the more recent theoretical and computational developments in non-linear programming are surveyed. The notions of Lagrange multipliers and duality are discussed together with applications of these ideas to scientific and business problems. Moreover, several algorithms for solving quadratic programming problems are reviewed.
openaire   +2 more sources

Computer programs for non‐linear programming

International Journal of Mathematical Education in Science and Technology, 1987
In this paper we consider the problem of maximizing a non‐linear or linear objective function subject to non‐linear and/or linear constraints. The approach used is an adaptive random search with some non‐random searches built‐in. The algorithm begins with a given point which is replaced by another point if the latter satisfies each of the constraints ...
openaire   +1 more source

A Duality Theorem for Non‐Linear Programming

ZAMM - Journal of Applied Mathematics and Mechanics / Zeitschrift für Angewandte Mathematik und Mechanik, 1965
AbstractIn this paper, a dual problem is formulated for non‐linear programming problem of minimising a convex function under concave constraints and non‐negativity restrictions on the variables (x1, x2…, xn). The problem of P. Wolfe has been discussed with considerably reduced number of variables known as Lagrange multipliers ui.
openaire   +2 more sources

An Aggregate Constraint Method for Non-linear Programming

Journal of the Operational Research Society, 1991
The problem under consideration is to minimize \(f(x)\), \(x\in R^n\), subject to the constraints (P): \(g_i(x)\leq 0\), \(i=1,\ldots,m\). In order to replace (P) by just one constraint, \(g_s(x,\lambda)\leq 0\), the author defines a convex combination of the form \[ g_s(x,\lambda)=\sum^m_{i=1}\lambda_ig_i(x), \quad\sum\lambda_i=1,\quad 0\leq\lambda_i,
openaire   +2 more sources

Duality for non-linear programming in aBanach space

Unternehmensforschung Operations Research - Recherche Opérationnelle, 1969
A constrained maximization problem in a realBanach space is considered, where the objective function is a non-linear pseudo concave functional and constraints are given bym non linear quasi convex functionals. The optimality conditions and converse duality theorem, given byRitter, have been extended to this class of programming problems.
openaire   +2 more sources

Non-linear subsidiary problems in mathematical programming

USSR Computational Mathematics and Mathematical Physics, 1976
Abstract IT IS proposed to use the conjugate gradient method in linear and non-linear programming problems and to estimate the Lagrange multipliers from the analytic solution of subsidiary problems. Recently iterative methods of solving non-linear programming problems using various auxiliary problems [1–5] to construct the vector step, have become ...
Volynskii, E. I., Henkin, M. Z.
openaire   +3 more sources

Non-linear fitting program for biological data

International Journal of Bio-Medical Computing, 1986
A simple microcomputer program written in Microsoft Basic estimates pharmacokinetic parameters using the coordinate search technique to minimize the sum of squared errors. The program developed for portable computers combines a plot of data and curve fitting so as to find rapidly the initial parameters with the subsequent optimization of the parameter ...
I, Bartosek, D, Verotta
openaire   +2 more sources

Buckling analysis by means of non‐linear programming

International Journal for Numerical Methods in Engineering, 1970
AbstractThis paper demonstrates the applicability of general non‐linear programming methods to the solution of buckling problems. The minimum energy formulation of the buckling condition is shown to yield an unconstrained non‐linear programming problem, for which several numerical methods of solution are readily available.
Gisvold, Kaare M., Moe, Johannes
openaire   +2 more sources