ALBERT

All Library Books, journals and Electronic Records Telegrafenberg

Your email was sent successfully. Check your inbox.

An error occurred while sending the email. Please try again.

Proceed reservation?

Export
Filter
  • Articles  (78)
  • nonlinear programming  (78)
  • 2000-2004  (2)
  • 1995-1999  (15)
  • 1980-1984  (15)
  • 1975-1979  (42)
  • 1970-1974  (4)
  • Mathematics  (78)
  • 1
    Electronic Resource
    Electronic Resource
    Springer
    Applications of mathematics 42 (1997), S. 311-320 
    ISSN: 1572-9109
    Keywords: nonlinear programming ; constrained problems ; C 1,1 functions ; second order conditions
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract To find nonlinear minimization problems are considered and standard C 2-regularity assumptions on the criterion function and constrained functions are reduced to C 1,1-regularity. With the aid of the generalized second order directional derivative for C 1,1 real-valued functions, a new second order necessary optimality condition and a new second order sufficient optimality condition for these problems are derived.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 2
    Electronic Resource
    Electronic Resource
    Springer
    Applied mathematics & optimization 6 (1980), S. 335-360 
    ISSN: 1432-0606
    Keywords: nonlinear programming ; multiplier methods ; penalty methods ; global convergence ; penalty limitation
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract This paper deals with penalty function and multiplier methods for the solution of constrained nonconvex nonlinear programming problems. Starting from an idea introduced several years ago by Polak, we develop a class of implementable methods which, under suitable assumptions, produce a sequence of points converging to a strong local minimum for the problem, regardless of the location of the initial guess. In addition, for sequential minimization type multiplier methods, we make use of a rate of convergence result due to Bertsekas and Polyak, to develop a test for limiting the growth of the penalty parameter and thereby prevent ill-conditioning in the resulting sequence of unconstrained optimization problems.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 3
    Electronic Resource
    Electronic Resource
    Springer
    Acta mathematicae applicatae sinica 13 (1997), S. 342-352 
    ISSN: 1618-3932
    Keywords: Hopfield-type neural network ; nonlinear programming
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract A Hopfield-type neural network with adaptively changing synaptic weights and activation function parameters is presented to solve unconstrained nonlinear programming problems. The network performance is similar to that of the trust region method in the mathematical programming literature. There is a sub-network to solve quadratic programming problems with simple upper and lower bounds. By sequentially activating the sub-network under the control of an externul computer or a special analog or digital processor that adjusts the weights and parameters, the network solves a sequence of unconstrained nonlinear programming problems. Convergence proof and numerical results are given.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 4
    Electronic Resource
    Electronic Resource
    Springer
    Journal of optimization theory and applications 14 (1974), S. 453-476 
    ISSN: 1573-2878
    Keywords: Newton-Raphson method ; quasilinearization method ; mathematical programming ; nonlinear programming ; quadratically convergent algorithms.
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract The usual approach to Newton's method for mathematical programming problems with equality constraints leads to the solution of linear systems ofn +m equations inn +m unknowns, wheren is the dimension of the space andm is the number of constraints. Moreover, these linear systems are never positive definite. It is our feeling that this approach is somewhat artificial, since in the unconstrained case the linear systems are very often positive definite. With this in mind, we present an alternate Newton-like approach for the constrained problem in which all the linear systems are of order less than or equal ton. Furthermore, when the Hessian of the Lagrangian at the solution is positive definite (a situation frequently occurring), all our systems will be positive definite. Hence, in all cases, our Newton-like method offers greater numerical stability. We demonstrate that the convergence properties of this Newton-like method are superior to those of the standard approach to Newton's method. The operation count for the new method using Gaussian elimination is of the same order as the operation count for the standard method. However, if the Hessian of the Lagrangian at the solution is positive definite and we use Cholesky decomposition, then the order of the operation count for the new method is half that for the standard approach to Newton's method. This theory is generalized to problems with both equality and inequality constraints.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 5
    Electronic Resource
    Electronic Resource
    Springer
    Journal of optimization theory and applications 15 (1975), S. 667-684 
    ISSN: 1573-2878
    Keywords: Necessary conditions ; mathematical programming ; Banach spaces ; optimization theorems ; nonlinear programming
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract In this paper, necessary optimality conditions for nonlinear programs in Banach spaces and constraint qualifications for their applicability are considered. A new optimality condition is introduced, and a constraint qualification ensuring the validity of this condition is given. When the domain space is a reflexive space, it is shown that the qualification is the weakest possible. If a certain convexity assumption is made, then this optimality condition is shown to reduce to the well-known extension of the Kuhn-Tucker conditions to Banach spaces. In this case, the constraint qualification is weaker than those previously given.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 6
    Electronic Resource
    Electronic Resource
    Springer
    Journal of optimization theory and applications 17 (1975), S. 481-491 
    ISSN: 1573-2878
    Keywords: Parameter optimization ; suboptimal control ; trajectory optimization ; Newton-Raphson methods ; nonlinear programming
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract The optimal control problem is reduced to a suboptimal control problem by assuming the control histories to have particular functional forms involving a number of undetermined constants (Raleigh-Ritz method). A second-order parameter optimization method is discussed and applied to the suboptimal control problem. Also, it is shown that this approach can be used to obtain approximate Lagrange multiplier distributions for optimal control problems.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 7
    Electronic Resource
    Electronic Resource
    Springer
    Journal of optimization theory and applications 20 (1976), S. 1-12 
    ISSN: 1573-2878
    Keywords: Methods of multipliers ; nonlinear programming ; numerical methods ; optimization theorems ; quadratically convergent algorithms
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract In a recent paper (Ref. 1), the author briefly mentioned a variant of Hestenes' method of multipliers which would converge quadratically. This note examines that method in detail and provides some examples. In the quadratic-linear case, this algorithm converges in one iteration.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 8
    Electronic Resource
    Electronic Resource
    Springer
    Journal of optimization theory and applications 20 (1976), S. 297-313 
    ISSN: 1573-2878
    Keywords: Mathematical programming ; nonlinear programming ; inequality constraints ; numerical methods ; descent methods
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract This paper is concerned with first-order methods of feasible directions. Pironneau and Polak have recently proved theorems which show that three of these methods have a linear rate of convergence for certain convex problems in which the objective functions have positive definite Hessians near the solutions. In the present note, it is shown that these theorems on rate of convergence can be extended to larger classes of problems. These larger classes are determined in part by certain second-order sufficiency conditions, and they include many nonconvex problems. The arguments used here are based on the finite-dimensional version of Hestenes' indirect sufficiency method.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 9
    Electronic Resource
    Electronic Resource
    Springer
    Journal of optimization theory and applications 21 (1977), S. 137-174 
    ISSN: 1573-2878
    Keywords: Augmented penalty function ; method of multipliers ; penalty function methods ; nonlinear programming ; mathematical programming
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract This paper describes an accelerated multiplier method for solving the general nonlinear programming problem. The algorithm poses a sequence of unconstrained optimization problems. The unconstrained problems are solved using a rank-one recursive algorithm described in an earlier paper. Multiplier estimates are obtained by minimizing the error in the Kuhn-Tucker conditions using a quadratic programming algorithm. The convergence of the sequence of unconstrained problems is accelerated by using a Newton-Raphson extrapolation process. The numerical effectiveness of the algorithm is demonstrated on a relatively large set of test problems.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 10
    Electronic Resource
    Electronic Resource
    Springer
    Journal of optimization theory and applications 21 (1977), S. 529-530 
    ISSN: 1573-2878
    Keywords: Complementarity ; mathematical programming ; monotone maps ; nonlinear programming
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract We show by an example that, in a complementarity problem where the given map is continuous and monotone on the nonnegative orthant, the existence of a feasible solution is not sufficient to guarantee existence of a solution to the complementarity problem.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 11
    Electronic Resource
    Electronic Resource
    Springer
    Journal of optimization theory and applications 22 (1977), S. 135-194 
    ISSN: 1573-2878
    Keywords: Newton-Raphson method ; quasi-Newton method ; nonlinear programming ; multiplier method ; augmented Lagrangian method
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract Two approaches to quasi-Newton methods for constrained optimization problems inR n are presented. These approaches are based on a class of Lagrange multiplier approximation formulas used by the author in his previous work on Newton's method for constrained problems. The first approach is set in the framework of a diagonalized multiplier method. From this point of view, a new update rule for the Lagrange multipliers which depends on the particular quasi-Newton method employed is given. This update rule, in contrast to most other update rules, does not require exact minimization of the intermediate unconstrained problem. In fact, the optimal convergence rate is attained in the extreme case when only one step of a quasi-Newton method is taken on this intermediate problem. The second approach transforms the constrained optimization problem into an unconstrained problem of the same dimension.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 12
    Electronic Resource
    Electronic Resource
    Springer
    Journal of optimization theory and applications 22 (1977), S. 209-226 
    ISSN: 1573-2878
    Keywords: Mathematical programming ; nonlinear programming ; gradient methods ; feasible direction methods ; convergence
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract The paper presents modifications of the generalized reduced gradient method which allows for a convergence proof. For that, a special construction of the basis is introduced, and some tools of the theory of feasible direction are used to modify the common choice of the direction at every step.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 13
    Electronic Resource
    Electronic Resource
    Springer
    Journal of optimization theory and applications 22 (1977), S. 227-237 
    ISSN: 1573-2878
    Keywords: Mathematical programming ; nonlinear programming ; method of multipliers ; necessary conditions ; sufficient conditions
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract The connection between the convergence of the Hestenes method of multipliers and the existence of augmented Lagrange multipliers for the constrained minimum problem (P): minimizef(x), subject tog(x)=0, is investigated under very general assumptions onX,f, andg. In the first part, we use the existence of augmented Lagrange multipliers as a sufficient condition for the convergence of the algorithm. In the second part, we prove that this is also a necessary condition for the convergence of the method and the boundedness of the sequence of the multiplier estimates. Further, we give very simple examples to show that the existence of augmented Lagrange multipliers is independent of smoothness condition onf andg. Finally, an application to the linear-convex problem is given.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 14
    Electronic Resource
    Electronic Resource
    Springer
    Journal of optimization theory and applications 33 (1981), S. 479-495 
    ISSN: 1573-2878
    Keywords: Lagrangians ; nonlinear programming ; Kuhn-Tucker theory ; convex optimization
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract For convex optimization inR n,we show how a minor modification of the usual Lagrangian function (unlike that of the augmented Lagrangians), plus a limiting operation, allows one to close duality gaps even in the absence of a Kuhn-Tucker vector [see the introductory discussion, and see the discussion in Section 4 regarding Eq. (2)]. The cardinality of the convex constraining functions can be arbitrary (finite, countable, or uncountable). In fact, our main result (Theorem 4.3) reveals much finer detail concerning our limiting Lagrangian. There are affine minorants (for any value 0〈θ≤1 of the limiting parameter θ) of the given convex functions, plus an affine form nonpositive onK, for which a general linear inequality holds onR nAfter substantial weakening, this inequality leads to the conclusions of the previous paragraph. This work is motivated by, and is a direct outgrowth of, research carried out jointly with R. J. Duffin.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 15
    Electronic Resource
    Electronic Resource
    Springer
    Journal of optimization theory and applications 26 (1978), S. 243-252 
    ISSN: 1573-2878
    Keywords: Geometric programming ; duality ; subsidiary problems ; nonlinear programming
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract The aim of this paper is not to derive new results, but rather to provide insight that will hopefully aid researchers involved in the design and coding of algorithms for geometric programs. The main contributions made here are: (i) a computationally useful interpretation of the Lagrange multipliers associated with the dual orthogonality constraints, (ii) a computationally useful interpretation of the Lagrange multiplier associated with the dual normality constraint, and (iii) an analysis of the much-avoided issue of subsidiary problems.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 16
    Electronic Resource
    Electronic Resource
    Springer
    Journal of optimization theory and applications 26 (1978), S. 253-264 
    ISSN: 1573-2878
    Keywords: Geometric programs ; optimization ; generalized reduced gradient method ; nonlinear programming
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract This paper describes the performance of a general-purpose GRG code for nonlinear programming in solving geometric programs. The main conclusions drawn from the experiments reported are: (i) GRG competes well with special-purpose geometric programming codes in solving geometric programs; and (ii) standard time, as defined by Colville, is an inadequate means of compensating for different computing environments while comparing optimization algorithms.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 17
    Electronic Resource
    Electronic Resource
    Springer
    Journal of optimization theory and applications 26 (1978), S. 305-323 
    ISSN: 1573-2878
    Keywords: Optimal design ; cooling towers ; geometric programming ; posynomials ; nonlinear programming ; engineering design
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract In this paper, the optimal design of dry-type natural-draft cooling towers is investigated. Using physical laws and engineering design relations that govern the system, a rather detailed optimization model is developed. This model is then reformulated as a geometric programming problem. A primary consideration in this reformulation is how certain polynomial equations may be effectively replaced by inequalities. A numerical example follows.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 18
    Electronic Resource
    Electronic Resource
    Springer
    Journal of optimization theory and applications 36 (1982), S. 495-519 
    ISSN: 1573-2878
    Keywords: Optimization ; nonlinear programming ; Numerical methods ; computational methods ; augmented Lagrangian functions
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract In this paper, a new augmented Lagrangian function is introduced for solving nonlinear programming problems with inequality constraints. The relevant feature of the proposed approach is that, under suitable assumptions, it enables one to obtain the solution of the constrained problem by a single unconstrained minimization of a continuously differentiable function, so that standard unconstrained minimization techniques can be employed. Numerical examples are reported.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 19
    Electronic Resource
    Electronic Resource
    Springer
    Journal of optimization theory and applications 26 (1978), S. 485-500 
    ISSN: 1573-2878
    Keywords: Newton-Raphson method ; nonlinear programming ; method of multipliers ; augmented Lagrangian method
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract In this study, we consider a modification of the method of multipliers of Hestenes and Powell in which the iteration is diagonalized, that is, only a fixed finite number of iterations of Newton's method are taken in the primal minimization stage. Conditions are obtained for quadratic convergence of the standard method, and it is shown that a diagonalization where two Newton steps are taken preserves the quadratic convergence for all multipler update formulas satisfying these conditions.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 20
    Electronic Resource
    Electronic Resource
    Springer
    Journal of optimization theory and applications 26 (1978), S. 515-532 
    ISSN: 1573-2878
    Keywords: Multiplier method ; quadratic convergence ; nonlinear programming ; slack variables
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract This paper presents a multiplier-type method for nonlinear programming problems with both equality and inequality constraints. Slack variables are used for the inequalities. The penalty coefficient is adjusted automatically, and the method converges quadratically to points satisfying second-order conditions.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 21
    Electronic Resource
    Electronic Resource
    Springer
    Journal of optimization theory and applications 28 (1979), S. 1-9 
    ISSN: 1573-2878
    Keywords: Nonlinear optimization ; conjugate-gradient methods ; numerical methods ; computing methods ; mathematical programming ; nonlinear programming
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract Three variants of the classical conjugate-gradient method are presented. Two of these variants are based upon a nonlinear function of a quadratic form. A restarting procedure due to Powell, and based upon some earlier work of Beale, is discussed and incorporated into two of the variants. Results of applying the four algorithms to a set of benchmark problems are included, and some tentative conclusions about the relative merits of the four schemes are presented.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 22
    Electronic Resource
    Electronic Resource
    Springer
    Journal of optimization theory and applications 29 (1979), S. 521-558 
    ISSN: 1573-2878
    Keywords: Quasi-Newton algorithm ; constrained minimization ; symmetric rank-one update ; nonlinear programming
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract We consider the problem of minimizing a differentiable function ofn parameters, with upper and lower bounds on the parameters. The motivation for this work comes from the optimization of the design of transient electrical circuits. In such optimization, the parameters are circuit elements, the bound constraints keep these parameters physically meaningful, and both the function and gradient evaluations contain errors. We describe a quasi-Newton algorithm for such problems. This algorithm handles the box constraints directly and approximates the given function locally by nonsingular quadratic functions. Numerical tests indicate that the algorithm can tolerate the errors, if the errors in the function and gradient are of the same relative size.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 23
    Electronic Resource
    Electronic Resource
    Springer
    Journal of optimization theory and applications 29 (1979), S. 493-519 
    ISSN: 1573-2878
    Keywords: Quasi-Newton formulas ; nonlinear programming ; symmetric rank-one update
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract We consider the symmetric rank-one, quasi-Newton formula. The hereditary properties of this formula do not require quasi-Newton directions of search. Therefore, this formula is easy to use in constrained optimization algorithms; no explicit projections of either the Hessian approximations or the parameter changes are required. Moreover, the entire Hessian approximation is available at each iteration for determining the direction of search, which need not be a quasi-Newton direction. Theoretical difficulties, however, exist. Even for a positive-definite, quadratic function with no constraints, it is possible that the symmetric rank-one update may not be defined at some iteration. In this paper, we first demonstrate that such failures of definition correspond to either losses of independence in the directions of search being generated or to near-singularity of the Hessian approximation being generated. We then describe a procedure that guarantees that these updates are well-defined for any nonsingular quadratic function. This procedure has been incorporated into an algorithm for minimizing a function subject to box constraints. Box constraints arise naturally in the minimization of a function with many minima or a function that is defined only in some subregion of the space.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 24
    Electronic Resource
    Electronic Resource
    Springer
    Journal of optimization theory and applications 30 (1980), S. 161-179 
    ISSN: 1573-2878
    Keywords: Optimization techniques ; nonlinear programming ; direct methods ; numerical methods ; conjugate directions ; nongradient methods ; ridge-path methods
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract A modification based on a linearization of a ridge-path optimization method is presented. The linearized ridge-path method is a nongradient, conjugate direction method which converges quadratically in half the number of search directions required for Powell's method of conjugate directions. The ridge-path method and its modification are compared with some basic algorithms, namely, univariate method, steepest descent method, Powell's conjugate direction method, conjugate gradient method, and variable-metric method. The assessment indicates that the ridge-path method, with modifications, could present a promising technique for optimization.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 25
    Electronic Resource
    Electronic Resource
    Springer
    Journal of optimization theory and applications 31 (1980), S. 27-39 
    ISSN: 1573-2878
    Keywords: Least-square methods ; variable-metric methods ; Levenberg-Marquardt methods ; nonlinear programming ; testing algorithms
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract Computational results are presented for Davidon's new least-square algorithm. Computational experience with this algorithm is reported which motivated the development of a production code version of the algorithm. Several heuristic modifications, which have been added, are described. Fifteen zero-residual test problems have been used in comparing the new production code version with two established versions of the Levenberg-Marquardt algorithm. The production code version of Davidon's least-square algorithm performed faster and used less function evaluations than the Levenberg-Marquardt algorithm in almost every case of the test problems.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 26
    Electronic Resource
    Electronic Resource
    Springer
    Journal of optimization theory and applications 31 (1980), S. 361-371 
    ISSN: 1573-2878
    Keywords: Nash-equilibrium solutions ; partially controllable strategies ; nonlinear programming ; complementary eigenvalue problems
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract The present paper deals with a class of nonzero-sum, two-person games with finite strategies when there are constraints on the strategies selected by the players. The constraints arise due to the subjective difficulty that each player often has in assigning to the states probabilities with which he is completely satisfied, and the model specifies how much each player must perturb his initial probability estimate in order to change his maximum utility alternative from the alternative originally best under the initial estimate. It is shown that the Nash-equilibrium solution of this class of nonzero-sum games can be characterized by an equivalent nonlinear program which leads in some cases to a pair of complementary eigenvalue problems. Applications to normal or approximate solutions of linear programming problems are also indicated.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 27
    Electronic Resource
    Electronic Resource
    Springer
    Journal of optimization theory and applications 32 (1980), S. 407-425 
    ISSN: 1573-2878
    Keywords: Generalized convexity ; global minimality ; nonlinear programming ; nonconvex programming ; optimization theorems
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract In this paper, new classes of generalized convex functions are introduced, extending the concepts of quasi-convexity, pseudoconvexity, and their associate subclasses. Functions belonging to these classes satisfy certain local-global minimum properties. Conversely, it is shown that, under some mild regularity conditions, functions for which the local-global minimum properties hold must belong to one of the classes of functions introduced.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 28
    Electronic Resource
    Electronic Resource
    Springer
    Journal of optimization theory and applications 43 (1984), S. 237-263 
    ISSN: 1573-2878
    Keywords: Geometric programming ; computational comparisons ; nonlinear programming ; ellipsoid algorithm ; generalized reduced gradient algorithm
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract We study the performance of four general-purpose nonlinear programming algorithms and one special-purpose geometric programming algorithm when used to solve geometric programming problems. Experiments are reported which show that the special-purpose algorithm GGP often finds approximate solutions more quickly than the general-purpose algorithm GRG2, but is usually not significantly more efficient than GRG2 when greater accuracy is required. However, for some of the most difficult test problems attempted, GGP was dramatically superior to all of the other algorithms. The other algorithms are usually not as efficient as GGP or GRG2. The ellipsoid algorithm is most robust.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 29
    Electronic Resource
    Electronic Resource
    Springer
    Journal of optimization theory and applications 43 (1984), S. 527-541 
    ISSN: 1573-2878
    Keywords: Linear complementarity ; nonlinear programming ; gradient projection method
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract The Levitin-Poljak gradient-projection method is applied to solve the linear complementarity problem with a nonsymmetric matrixM, which is either a positive-semidefinite matrix or aP-matrix. Further-more, if the quadratic functionx T(Mx + q) is pseudoconvex on the feasible region {x ∈R n |Mx + q ≥ 0,x≥0}, then the gradient-projection method generates a sequence converging to a solution, provided that the problem has a solution. For the case when the matrixM is aP-matrix and the solution is nondegenerate, the gradient-projection method is finite.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 30
    Electronic Resource
    Electronic Resource
    Springer
    Journal of optimization theory and applications 16 (1975), S. 25-38 
    ISSN: 1573-2878
    Keywords: Mathematical programming ; quadratically convergent algorithms ; conjugate-direction methods ; linearly constrained nonlinear programming ; nonlinear programming
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract An iterative procedure is presented which uses conjugate directions to minimize a nonlinear function subject to linear inequality constraints. The method (i) converges to a stationary point assuming only first-order differentiability, (ii) has ann-q step superlinear or quadratic rate of convergence with stronger assumptions (n is the number of variables,q is the number of constraints which are binding at the optimum), (iii) requires the computation of only the objective function and its first derivatives, and (iv) is experimentally competitive with well-known methods.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 31
    Electronic Resource
    Electronic Resource
    Springer
    Journal of optimization theory and applications 16 (1975), S. 207-220 
    ISSN: 1573-2878
    Keywords: Duality theory ; nonlinear programming ; mathematical programming ; convex programming ; optimization theorems
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract Duality relations for the programming problem of a special class where the objective function is a sum of positive-semidefinite quadratic forms, and a sum of square roots of positive-semidefinite quadratic forms, over a convex polyhedral cone in complex space are considered. The duality relations between the primal problem and its dual are established.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 32
    Electronic Resource
    Electronic Resource
    Springer
    Journal of optimization theory and applications 35 (1981), S. 517-533 
    ISSN: 1573-2878
    Keywords: Two-level planning ; multi-objective systems ; decentralized systems ; resource allocation ; nonlinear programming
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract We consider optimization methods for hierarchical power-decentralized systems composed of a coordinating central system and plural semi-autonomous local systems in the lower level, each of which possesses a decision making unit. Such a decentralized system where both central and local systems possess their own objective function and decision variables is a multi-objective system. The central system allocates resources so as to optimize its own objective, while the local systems optimize their own objectives using the given resources. The lower level composes a multi-objective programming problem, where local decision makers minimize a vector objective function in cooperation. Thus, the lower level generates a set of noninferior solutions, parametric with respect to the given resources. The central decision maker, then, parametric with respect to the given resources. The central decision maker, then, chooses an optimal resource allocation and the best corresponding noninferior solution from among a set of resource-parametric noninferior solutions. A computational method is obtained based on parametric nonlinear mathematical programming using directional derivatives. This paper is concerned with a combined theory for the multi-objective decision problem and the general resource allocation problem.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 33
    Electronic Resource
    Electronic Resource
    Springer
    Mathematical methods of operations research 46 (1997), S. 287-307 
    ISSN: 1432-5217
    Keywords: Reliability-based optimization ; structural reliability ; cost function ; nonlinear programming ; Monte Carlo simulation
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics , Economics
    Notes: Abstract A method to carry out a Reliability-Based Optimization (RBO) of especially nonlinear structural systems is introduced. Statistical uncertainties involving both structural and loading properties are considered. The concept is based on the separation of structural reliability analyses and the optimization procedures. Two approaches are discussed, depending on the interaction of reliability analysis and mathematical programming and the way of representation of the limit state functions (LSF) of the structure. As, for cases of practical significance, the LSF is known only pointwise it is approximated by Response Surfaces (RS). For the response calculations Finite Element (FE) procedures are utilized. Failure probabilities are determined by applying variance reducing Monte Carlo simulation (MCS) techniques such as Importance Sampling (IS). Following the reliability analysis, the optimization procedure is controlled by the NLPQL algorithm. A numerical example in terms of a template ocean platform exemplifies the procedures.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 34
    Electronic Resource
    Electronic Resource
    Springer
    Mathematical methods of operations research 50 (1999), S. 121-134 
    ISSN: 1432-5217
    Keywords: Key words: Risk measurement ; global optimization ; quadratic programming ; nonlinear programming ; polynomial-approximation algorithm
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics , Economics
    Notes: Abstract. Effective risk management requires adequate risk measurement. A basic problem herein is the quantification of market risks: what is the overall effect on a portfolio if market rates change? First, a mathematical problem statement is given and the concept of `Maximum Loss' (ML) is introduced as a method for identifying the worst case in a given set of scenarios, called `Trust Region'. Next, a technique for calculating efficiently the Maximum Loss for quadratic functions is described; the algorithm is based on the Levenberg-Marquardt theorem, which reduces the high dimensional optimization problem to a one dimensional root finding.  Following this, the idea of the `Maximum Loss Path' is presented: repetitive calculation of ML for growing trust regions leads to a sequence of worst case scenarios, which form a complete path; similarly, the path of `Maximum Profit' (MP) can be determined. Finally, all these concepts are applied to nonquadratic portfolios: so-called `Dynamic Approximations' are used to replace arbitrary profit and loss functions by a sequence of quadratic functions, which can be handled with efficient solution procedures. A description of the overall algorithm rounds off the discussion of nonlinear portfolios.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 35
    Electronic Resource
    Electronic Resource
    Springer
    Mathematical methods of operations research 47 (1998), S. 355-400 
    ISSN: 1432-5217
    Keywords: sequential quadratic programming ; SQP method ; nonlinear programming
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics , Economics
    Notes: Abstract Successful treatment of inconsistent QP problems is of major importance in the SQP method, since such occur quite often even for well behaved nonlinear programming problems. This paper presents a new technique for regularizing inconsistent QP problems, which compromises in its properties between the simple technique of Pantoja and Mayne [36] and the highly successful, but expensive one of Tone [47]. Global convergence of a corresponding algorithm is shown under reasonable weak conditions. Numerical results are reported which show that this technique, combined with a special method for the case of regular subproblems, is quite competitive to highly appreciated established ones.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 36
    Electronic Resource
    Electronic Resource
    Springer
    Journal of optimization theory and applications 104 (2000), S. 255-279 
    ISSN: 1573-2878
    Keywords: nonlinear programming ; path-following methods ; differential equations ; projective algorithms
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract A new method for linearly constrained nonlinear programming is proposed. This method follows affine scaling paths defined by systems of ordinary differential equations and it is fully parallelizable. The convergence of the method is proved for a nondegenerate problem with pseudoconvex objective function. In practice, the algorithm works also under more general assumptions on the objective function. Numerical results obtained with this computational method on several test problems are shown.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 37
    Electronic Resource
    Electronic Resource
    Springer
    Journal of optimization theory and applications 107 (2000), S. 591-600 
    ISSN: 1573-2878
    Keywords: Cauchy method ; steepest descent ; convex programming ; nonlinear programming
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract We discuss two issues related to the Cauchy algorithm. First, we use anArmijo search with constant α≥0.5 and show that the sequence isFejer convergent to the optimal set, and hence convergent. Second, we useexact line searches and show an example in which the sequence fails toconverge.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 38
    Electronic Resource
    Electronic Resource
    Springer
    Journal of optimization theory and applications 13 (1974), S. 461-483 
    ISSN: 1573-2878
    Keywords: Duality theory ; linear systems ; nonlinear programming ; convex programming ; distributed control systems
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract A class of singular control problems involving amplitude constraints on the controls is examined. IfL ∞ is the space of control functionsU, the control constraint setS can be identified with the unit ball inL ∞. Now, for anyn ∈ (1, ∞), an analogous problem may be set up withL n forU and the unit ball inL n forS. This modified problem is necessarily nonsingular for controllable systems. It is shown that, by takingn sufficiently large, the solution to the modified problem also solves the original problem arbitrarily closely (in a sense made precise). Behavior asn → ∞ is investigated.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 39
    Electronic Resource
    Electronic Resource
    Springer
    Journal of optimization theory and applications 15 (1975), S. 51-67 
    ISSN: 1573-2878
    Keywords: Structural design ; plastic design ; nonlinear systems ; large displacements ; nonlinear programming
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract Discrete or discretized structures are considered in the range of large displacements. Elastic plastic behavior is assumed, under the hypothesis that both yield functions and hardening rules are piecewise linear. The structural response to a single finite loading step is assumed to involve regularly progressive yielding (no local unloading). An extremum property of this structural response is established, by recognizing that the relations governing the configuration change coincide with the Kuhn-Tucker conditions of a particular nonlinear constrained optimization problem, subject to sign constraints alone. This extremum property can be regarded as an extension of the theorem of minimum potential energy. Other properties, even if computationally less attractive, broaden the theory developed, so that some results previously obtained are derived as special cases.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 40
    Electronic Resource
    Electronic Resource
    Springer
    Journal of optimization theory and applications 18 (1976), S. 199-228 
    ISSN: 1573-2878
    Keywords: Mathematical programming ; nonlinear programming ; penalty-function methods ; convergence rate ; method of centers
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract Convergence of a method of centers algorithm for solving nonlinear programming problems is considered. The algorithm is defined so that the subproblems that must be solved during its execution may be solved by finite-step procedures. Conditions are given under which the algorithm generates sequences of feasible points and constraint multiplier vectors that have accumulation points satisfying the Fritz John or the Kuhn-Tucker optimality conditions. Under stronger assumptions, linear convergence rates are established for the sequences of objective function, constraint function, feasible point, and multiplier values.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 41
    Electronic Resource
    Electronic Resource
    Springer
    Journal of optimization theory and applications 19 (1976), S. 233-259 
    ISSN: 1573-2878
    Keywords: Geometric programming ; signomial functions ; computing methods ; nonlinear programming
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract A computational comparison of several methods for dealing with polynomial geometric programs is presented. Specifically, we compare the complementary programs of Avriel and Williams (Ref. 1) with the reversed programs and the harmonic programs of Duffin and Peterson (Refs. 2, 3). These methods are used to generate a sequence of posynomial geometric programs which are solved using a dual algorithm.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 42
    Electronic Resource
    Electronic Resource
    Springer
    Journal of optimization theory and applications 19 (1976), S. 455-468 
    ISSN: 1573-2878
    Keywords: Control theory ; Lagrange problems ; bounded control problems ; maximum principle ; nonlinear programming
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract In this paper, we derive necessary conditions for a measurable controlu with values in a compact convex subsetU ofR P to minimize the integral $$\int_a^b {b^0 (s,x(s),u(s))} ds$$ subject to equality and inequality state constraints. The general conditions take the form of a maximum principle which involves an integration with respect to a finitely additive set function, but conditions are given under which this reduces to the classical maximum principle. These results are similar to results derived in Ref. 1 for relaxed controls.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 43
    Electronic Resource
    Electronic Resource
    Springer
    Journal of optimization theory and applications 20 (1976), S. 155-170 
    ISSN: 1573-2878
    Keywords: Unconstrained minimization ; pseudo-Newton-Raphson methods ; quasi-Newton methods ; variable-metric methods ; nonlinear programming
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract This paper surveys some of the existing approaches to quasi-Newton methods and introduces a new way for constructing inverse Hessian approximations for such algorithms. This new approach is based on restricting Newton's method to subspaces over which the inverse Hessian is assumed to be known, while expanding this subspace using gradient information. It is shown that this approach can lead to some well-known formulas for updating the inverse Hessian approximation. Deriving such updates through this approach provides new understanding of these formulas and their relation to the pseudo-Newton-Raphson algorithm.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 44
    Electronic Resource
    Electronic Resource
    Springer
    Journal of optimization theory and applications 20 (1976), S. 171-189 
    ISSN: 1573-2878
    Keywords: Contact problems ; quadratic programming ; mechanics ; nonlinear programming ; contact stresses
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract Two-body, elastic, unbonded contact problems are formulated as quadratic programming problems. Uniqueness theorems of quadratic programming theory are applied to show that the solution of a contact problem, if one exists, is unique and can be readily found by the modified simplex method of quadratic programming. A solution technique that is compatible with finite-element methods is developed, so that contact problems with complex boundary configurations can be routinely solved. A number of classical and nonclassical problems are solved. Good agreement is found for problems with previously known solutions.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 45
    Electronic Resource
    Electronic Resource
    Springer
    Journal of optimization theory and applications 20 (1976), S. 269-295 
    ISSN: 1573-2878
    Keywords: Mathematical programming ; nonlinear programming ; inequality constraints ; numerical methods ; descent methods
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract The method of centers is a well-known method for solving nonlinear programming problems having inequality constraints. Pironneau and Polak have recently presented a new version of this method. In the new method, the direction of search is obtained, at each iteration, by solving a convex quadratic programming problem. This direction finding subprocedure is essentially insensitive to the dimension of the space on which the problem is defined. Moreover, the method of Pironneau and Polak is known to converge linearly for finite-dimensional convex programs for which the objective function has a positive-definite Hessian near the solution (and for which the functions involved are twice continuously differentiable). In the present paper, the method and a completely implementable version of it are shown to converge linearly for a very general class of finite-dimensional problems; the class is determined by a second-order sufficiency condition and includes both convex and nonconvex problems. The arguments employed here are based on the indirect sufficiency method of Hestenes. Furthermore, the arguments can be modified to prove linear convergence for a certain class of infinite-dimensional convex problems, thus providing an answer to a conjecture made by Pironneau and Polak.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 46
    Electronic Resource
    Electronic Resource
    Springer
    Journal of optimization theory and applications 21 (1977), S. 299-317 
    ISSN: 1573-2878
    Keywords: Aerospace engineering ; singular points ; nonlinear programming ; penalty-function methods ; variable-metric methods
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract A heuristic method is presented for determining the equilibrium states of motion of dynamic systems, in particular, spacecraft. The method can also be applied to the solution of sets of linear or nonlinear algebraic equations. A positive-semidefinite functional is formed to convert the problem to that of finding those minimum points where the functional vanishes. The process is initiated within a selecteddomain of interest by random search; convergence to a minimum is obtained by a modified Davidon's deflected gradient technique. To render this approach feasible in the presence of constraints, the functional is modified to include penalty terms which cause the functional to approach infinity at the constraint boundaries. Close approximations to solutions near the constraint boundaries are found by applying Carroll's approach in successively reducing the weighting factors of the penalty terms. After finding a minimum, the local domain around this point is eliminated by adding to the functional an interior constraint term, representing the surface under a hypersphere centered at the minimum point. The domain of consideration now becomes the subdomain formed by subtracting the space contained within this hypersphere from the previous domain of interest. Minima are now sought within the remaining space, as before.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 47
    Electronic Resource
    Electronic Resource
    Springer
    Journal of optimization theory and applications 22 (1977), S. 31-34 
    ISSN: 1573-2878
    Keywords: Decomposition ; nonlinear programming ; structural optimization ; trusses
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract A decomposition method, used in least-weight plastic design, is extended to solve problems with nonlinearity arising from variable structure geometry. The problem considered is that of finding vectorsx 1,x 2, andq that minimize [l max{|x 1|, |x 2|}], subject toAx 1=b 1 andAx 2=b 2, where both the vectorl and the matrixA are nonlinear functions ofq.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 48
    Electronic Resource
    Electronic Resource
    Springer
    Journal of optimization theory and applications 22 (1977), S. 311-351 
    ISSN: 1573-2878
    Keywords: Lipschitz continuous mappings ; generalized derivatives ; nonlinear programming ; multiplier rules ; implicit mapping theorem ; inverse mapping theorem
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract In this paper, four fundamental theorems for continuously differentiable mappings (the multiplier rule for equality constraints of Carathéodory, the inverse mapping theorem, the implicit mapping theorem, and the general multiplier rule for inequality and equality constraints of Mangasarian and Fromovitz) are shown to have natural extensions valid when the mappings are only Lipschitz continuous. Involved in these extensions is a compact, convex set of linear mappings called the generalized derivative, which can be assigned to any Lipschitz continuous mapping and point of its (open) domain and which reduces to the usual derivative whenever the mapping is continuously differentiable. After a brief calculus for this generalized derivative is presented in Part I, the connection between the ranks of the linear mappings in the generalized derivative and theinteriority of the given mapping is explored in Parts II and IV; this relationship is used in Parts III and IV to prove the extensions of the theorems mentioned above.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 49
    Electronic Resource
    Electronic Resource
    Springer
    Journal of optimization theory and applications 23 (1977), S. 487-510 
    ISSN: 1573-2878
    Keywords: Approximation ; multiplier methods ; nonlinear programming ; minimax problems ; Chebyshev approximation
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract In this paper, we consider a method for solving certain optimization problems with constraints, nondifferentiabilities, and other ill-conditioning terms in the cost functional by approximating them by well-behaved optimization problems. The approach is based on methods of multipliers. The convergence properties of the methods proposed can be inferred from corresponding properties of multiplier methods with partial elimination of constraints. A related analysis is provided in this paper.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 50
    Electronic Resource
    Electronic Resource
    Springer
    Journal of optimization theory and applications 24 (1978), S. 523-548 
    ISSN: 1573-2878
    Keywords: Multiplier method ; gradient projection method ; penalty function methods ; nonlinear programming ; parameter optimization
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract This paper describes a gradient projection-multiplier method for solving the general nonlinear programming problem. The algorithm poses a sequence of unconstrained optimization problems which are solved using a new projection-like formula to define the search directions. The unconstrained minimization of the augmented objective function determines points where the gradient of the Lagrangian function is zero. Points satisfying the constraints are located by applying an unconstrained algorithm to a penalty function. New estimates of the Lagrange multipliers and basis constraints are made at points satisfying either a Lagrangian condition or a constraint satisfaction condition. The penalty weight is increased only to prevent cycling. The numerical effectiveness of the algorithm is demonstrated on a set of test problems.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 51
    Electronic Resource
    Electronic Resource
    Springer
    Journal of optimization theory and applications 25 (1978), S. 407-414 
    ISSN: 1573-2878
    Keywords: Optimal control algorithms ; nonlinear programming ; sensitivity analysis ; switching-time location
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract A useful approach to the calculation of optimal controls is to take a piecewise constant approximation to the control and to solve the resulting nonlinear program using available techniques. There is no way of specifying the required number of control intervals a priori, but this paper shows that the adjoint system used to calculate gradients for the optimization provides at each iteration sufficient information to assess the gain from increasing the number of intervals and to indicate the best locations for the appropriate switching times. An example is presented which shows the potential computational savings that can be realized when the number of control intervals is progressively increased until the desired accuracy of the approximation is achieved.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 52
    Electronic Resource
    Electronic Resource
    Springer
    Journal of optimization theory and applications 25 (1978), S. 575-577 
    ISSN: 1573-2878
    Keywords: Implicit function theorem ; nonlinear programming
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract Suppose thatF:D⊂R n×Rm→Rn, withF(x 0,y 0)=0. The classical implicit function theorem requires thatF is differentiable with respect tox and moreover that ∂1 F(x 0,y 0) is nonsingular. We strengthen this theorem by removing the nonsingularity and differentiability requirements and by replacing them with a one-to-one condition onF as a function ofx.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 53
    Electronic Resource
    Electronic Resource
    Springer
    Journal of optimization theory and applications 37 (1982), S. 1-21 
    ISSN: 1573-2878
    Keywords: Sensitivity analysis ; geometric programming ; nonlinear programming
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract A unified approach to computing first, second, or higher-order derivatives of any of the primal and dual variables or multipliers of a geometric programming problem, with respect to any of the problem parameters (term coefficients, exponents, and constraint right-hand sides) is presented. Conditions under which the sensitivity equations possess a unique solution are developed, and ranging results are also derived. The analysis for approximating second and higher-order sensitivity generalizes to any sufficiently smooth nonlinear program.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 54
    Electronic Resource
    Electronic Resource
    Springer
    Journal of optimization theory and applications 40 (1983), S. 333-348 
    ISSN: 1573-2878
    Keywords: Numerical optimization ; global search ; nonlinear programming
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract The paper describes a new version, known as CRS2, of the author's controlled random search procedure for global optimization (CRS). The new procedure is simpler and requires less computer storage than the original version, yet it has a comparable performance. The results of comparative trials of the two procedures, using a set of standard test problems, are given. These test problems are examples of unconstrained optimization. The controlled random search procedure can also be effective in the presence of constraints. The technique of constrained optimization using CRS is illustrated by means of examples taken from the field of electrical engineering.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 55
    Electronic Resource
    Electronic Resource
    Springer
    Journal of optimization theory and applications 44 (1984), S. 701-721 
    ISSN: 1573-2878
    Keywords: Kuhn-Tucker points ; local and global minima ; nonlinear programming ; Morse functions ; convex transformable programs
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract Consider minimizingf onD which is diffeomorphic to a disk. Under a genericity assumption, the number of points onD satisfying the Kuhn-Tucker necessary conditions for minimum is odd. We give conditions which imply that a local minimum is global and a necessary and sufficient condition that a Kuhn-Tucker point is the solution. Convex transformable problems satisfy the latter condition.D may be of full dimension or be embedded on a manifold or it may be given by a system of concave inequalities.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 56
    Electronic Resource
    Electronic Resource
    Springer
    Journal of optimization theory and applications 16 (1975), S. 409-428 
    ISSN: 1573-2878
    Keywords: Stability of infinite programs ; continuity of mathematical programs ; nonlinear programming ; infinitely constrained problems ; stability analysis
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract The primary concern of this paper is to investigate stability conditions for the mathematical program: findx ∈E n that maximizesf(x):g j(x)≦0 for somej ∈J, wheref is a real scalarvalued function and eachg is a real vector-valued function of possibly infinite dimension. It should be noted that we allow, possibly infinitely many, disjunctive forms. In an earlier work, Evans and Gould established stability theorems wheng is a continuous finite-dimensional real-vector function andJ=1. It is pointed out that the results of this paper reduce to the Evans-Gould results under their assumptions. Furthermore, since we use a slightly more general definition of lower and upper semicontinuous point-to-set mappings, we can dispense with the continuity ofg (except in a few instances where it is implied by convexity assumptions).
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 57
    Electronic Resource
    Electronic Resource
    Springer
    Journal of optimization theory and applications 86 (1995), S. 407-420 
    ISSN: 1573-2878
    Keywords: Convex optimization ; interior-point methods ; nonlinear programming ; Newton's method ; method of centers
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract In this paper, we propose an interior-point method for minimizing a convex function subject to linear constraints. Our method employs ideas from a previously studied method due to Fan and Nekooie in a different context. Under certain assumptions, we show that the proposed method has a fast rate of convergence. A numerical example is included to illustrate the method.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 58
    Electronic Resource
    Electronic Resource
    Springer
    Journal of optimization theory and applications 89 (1996), S. 507-541 
    ISSN: 1573-2878
    Keywords: Interior-point methods ; primal-dual methods ; nonlinear programming ; superlinear and quadratic convergence ; global convergence
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract In this work, we first study in detail the formulation of the primal-dual interior-point method for linear programming. We show that, contrary to popular belief, it cannot be viewed as a damped Newton method applied to the Karush-Kuhn-Tucker conditions for the logarithmic barrier function problem. Next, we extend the formulation to general nonlinear programming, and then validate this extension by demonstrating that this algorithm can be implemented so that it is locally and Q-quadratically convergent under only the standard Newton method assumptions. We also establish a global convergence theory for this algorithm and include promising numerical experimentation.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 59
    Electronic Resource
    Electronic Resource
    Springer
    Journal of optimization theory and applications 92 (1997), S. 543-579 
    ISSN: 1573-2878
    Keywords: Recursive quadratic programming ; exact penalty functions ; nonlinear programming ; constrained optimization ; regularity conditions
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract A new, robust recursive quadratic programming algorithm model based on a continuously differentiable merit function is introduced. The algorithm is globally and superlinearly convergent, uses automatic rules for choosing the penalty parameter, and can efficiently cope with the possible inconsistency of the quadratic search subproblem. The properties of the algorithm are studied under weak a priori assumptions; in particular, the superlinear convergence rate is established without requiring strict complementarity. The behavior of the algorithm is also investigated in the case where not all of the assumptions are met. The focus of the paper is on theoretical issues; nevertheless, the analysis carried out and the solutions proposed pave the way to new and more robust RQP codes than those presently available.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 60
    Electronic Resource
    Electronic Resource
    Springer
    Journal of optimization theory and applications 100 (1999), S. 287-309 
    ISSN: 1573-2878
    Keywords: Method of feasible directions ; direction-finding subproblem ; global convergence ; feasible points ; nonlinear programming
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract This paper introduces two new algorithms for finding initial feasible points from initial infeasible points for the recently developed norm-relaxed method of feasible directions (MFD). Their global convergence is analyzed. The theoretical results show that both methods are globally convergent; one of them guarantees finding a feasible point in a finite number of steps. These two methods are very convenient to implement in the norm-relaxed MFD. Numerical experiments are carried out to demonstrate their performance on some classical test problems and to compare them with the traditional method of phase I problems. The numerical results show that the methods proposed in this paper are more effective than the method of phase I problems in the norm-relaxed MFD. Hence, they can be used for finding initial feasible points for other MFD algorithms and other nonlinear programming methods.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 61
    Electronic Resource
    Electronic Resource
    Springer
    Journal of optimization theory and applications 26 (1978), S. 3-13 
    ISSN: 1573-2878
    Keywords: Optimality conditions ; geometric programming ; nonlinear programming ; ordinary programming ; Kuhn-Tucker conditions
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract Generalizations of the Kuhn-Tucker optimality conditions are given, as are the fundamental theorems having to do with their necessity and sufficiency.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 62
    Electronic Resource
    Electronic Resource
    Springer
    Journal of optimization theory and applications 36 (1982), S. 477-494 
    ISSN: 1573-2878
    Keywords: Unconstrained optimization ; variable-metric methods ; quasi-Newton methods ; numerical algorithms ; nonlinear programming
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract Quasi-Newton algorithms minimize a functionF(x),x ∈R n, searching at any iterationk along the directions k=−H kgk, whereg k=∇F(x k) andH k approximates in some sense the inverse Hessian ofF(x) atx k. When the matrixH is updated according to the formulas in Broyden's family and when an exact line search is performed at any iteration, a compact algorithm (free from the Broyden's family parameter) can be conceived in terms of the followingn ×n matrix: $$H{_R} = H - Hgg{^T} H/g{^T} Hg,$$ which can be viewed as an approximating reduced inverse Hessian. In this paper, a new algorithm is proposed which uses at any iteration an (n−1)×(n−1) matrixK related toH R by $$H_R = Q\left[ {\begin{array}{*{20}c} 0 & 0 \\ 0 & K \\ \end{array} } \right]Q$$ whereQ is a suitable orthogonaln×n matrix. The updating formula in terms of the matrixK incorporated in this algorithm is only moderately more complicated than the standard updating formulas for variable-metric methods, but, at the same time, it updates at any iteration a positive definite matrixK, instead of a singular matrixH R. Other than the compactness with respect to the algorithms with updating formulas in Broyden's class, a further noticeable feature of the reduced Hessian algorithm is that the downhill condition can be stated in a simple way, and thus efficient line searches may be implemented.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 63
    Electronic Resource
    Electronic Resource
    Springer
    Journal of optimization theory and applications 27 (1979), S. 271-290 
    ISSN: 1573-2878
    Keywords: Optimal control ; boundary-value problems ; discretization ; nonlinear programming
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract A special time-optimal parabolic boundary-value control problem describing a one-dimensional heat-diffusion process is solved numerically. Using a bang-bang principle recently proved by Lempio, this problem can be transformed in such a way that the variables are jumps of bang-bang controls. A discretization is performed in two steps, and the convergence of the approximate solutions is proved. Finally, an algorithm to solve the discrete problem is developed and some numerical results are discussed.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 64
    Electronic Resource
    Electronic Resource
    Springer
    Journal of optimization theory and applications 16 (1975), S. 1-24 
    ISSN: 1573-2878
    Keywords: Penalty-function methods ; mathematical programming ; nonlinear programming ; pseudo Newton-Raphson methods ; parameter optimization
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract An effective algorithm is described for solving the general constrained parameter optimization problem. The method is quasi-second-order and requires only function and gradient information. An exterior point penalty function method is used to transform the constrained problem into a sequence of unconstrained problems. The penalty weightr is chosen as a function of the pointx such that the sequence of optimization problems is computationally easy. A rank-one optimization algorithm is developed that takes advantage of the special properties of the augmented performance index. The optimization algorithm accounts for the usual difficulties associated with discontinuous second derivatives of the augmented index. Finite convergence is exhibited for a quadratic performance index with linear constraints; accelerated convergence is demonstrated for nonquadratic indices and nonlinear constraints. A computer program has been written to implement the algorithm and its performance is illustrated in fourteen test problems.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 65
    Electronic Resource
    Electronic Resource
    Springer
    Journal of optimization theory and applications 35 (1981), S. 159-182 
    ISSN: 1573-2878
    Keywords: Variable penalty methods ; nonlinear programming ; sequential unconstrained minimization technique ; approximations ; Hessian matrix ; penalty methods ; ill-conditioning
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract A class of generalized variable penalty formulations for solving nonlinear programming problems is presented. The method poses a sequence of unconstrained optimization problems with mechanisms to control the quality of the approximation for the Hessian matrix, which is expressed in terms of the constraint functions and their first derivatives. The unconstrained problems are solved using a modified Newton's algorithm. The method is particularly applicable to solution techniques where an approximate analysis step has to be used (e.g., constraint approximations, etc.), which often results in the violation of the constraints. The generalized penalty formulation contains two floating parameters, which are used to meet the penalty requirements and to control the errors in the approximation of the Hessian matrix. A third parameter is used to vary the class of standard barrier or quasibarrier functions, forming a branch of the variable penalty formulation. Several possibilities for choosing such floating parameters are discussed. The numerical effectiveness of this algorithm is demonstrated on a relatively large set of test examples.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 66
    Electronic Resource
    Electronic Resource
    Springer
    Journal of optimization theory and applications 98 (1998), S. 467-473 
    ISSN: 1573-2878
    Keywords: Lipschitzian stability ; strong regularity ; perturbations ; nonlinear programming
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract For a nonlinear programming problem with a canonical perturbations, we give an elementary proof of the following result: If the Karush–Kuhn–Tucker map is locally single-valued and Lipschitz continuous, then the linear independence condition for the gradients of the active constraints and the strong second-order sufficient optimality condition hold.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 67
    Electronic Resource
    Electronic Resource
    Springer
    Journal of optimization theory and applications 14 (1974), S. 99-114 
    ISSN: 1573-2878
    Keywords: Engineering design ; nonlinear programming ; convex programming ; optimization theorems ; approximation of functions
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract A possible mathematical formulation of the practical problem of computer-aided design of electrical circuits (for example) and systems and engineering designs in general, subject to tolerances onk independent parameters, is proposed. An automated scheme is suggested, starting from arbitrary initial acceptable or unacceptable designs and culminating in designs which, under reasonable restrictions, are acceptable in the worst-case sense. It is proved, in particular, that, if the region of points in the parameter space for which designs are both feasible and acceptable satisfies a certain condition (less restrictive than convexity), then no more than 2 k points, the vertices of the tolerance region, need to be considered during optimization.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 68
    Electronic Resource
    Electronic Resource
    Springer
    Journal of optimization theory and applications 14 (1974), S. 477-495 
    ISSN: 1573-2878
    Keywords: Mathematical programming ; nonlinear programming ; penalty function methods ; gradient projection methods ; convergence analysis
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract A new programming algorithm for nonlinear constrained optimization problems is proposed. The method is based on the penalty function approach and thereby circumyents the necessity to maintain feasibility at each iteration, but it also behaves much like the gradient projection method. Although only first-order information is used, the algorithm converges asymptotically at a rate which is independent of the magnitude of the penalty term; hence, unlike the simple gradient method, the asymptotic rate of the proposed method is not affected by the ill-conditioning associated with the introduction of the penalty term. It is shown that the asymptotic rate of convergence of the proposed method is identical with that of the gradient projection method.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 69
    Electronic Resource
    Electronic Resource
    Springer
    Journal of optimization theory and applications 15 (1975), S. 131-143 
    ISSN: 1573-2878
    Keywords: Feasible direction method ; minimum-weight design ; structural analysis ; nonlinear programming ; truss design
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract An efficient algorithm, based on Zoutendijk's feasible direction methods, is developed primarily for elastic minimum weight design of trusses subjected to stress, displacement, and cross-sectional constraints. In determining a stepsize in a usable feasible direction, an elaborate procedure is developed to gain as much weight reduction with as little computational effort as possible. A step can be taken to get more weight reduction only if the additional reduction estimated justifies the additional cost.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 70
    Electronic Resource
    Electronic Resource
    Springer
    Journal of optimization theory and applications 18 (1976), S. 187-197 
    ISSN: 1573-2878
    Keywords: Least-square methods ; variable-metric methods ; gradient methods ; nonlinear programming
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract New algorithms are presented for approximating the minimum of the sum of squares ofM real and differentiable functions over anN-dimensional space. These algorithms update estimates for the location of a minimum after each one of the functions and its first derivatives are evaluated, in contrast with other least-square algorithms which evaluate allM functions and their derivatives at one point before using any of this information to make an update. These new algorithms give estimates which fluctuate about a minimum rather than converging to it. For many least-square problems, they give an adequate approximation for the solution more quickly than do other algorithms.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 71
    Electronic Resource
    Electronic Resource
    Springer
    Journal of optimization theory and applications 18 (1976), S. 555-559 
    ISSN: 1573-2878
    Keywords: Optimization theorems ; global minimality ; nonconvex programming ; nonlinear programming ; mathematical programming
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract In this note, a simple proof of a theorem concerning functions whose local minima are global is presented and some closedness properties of this class of functions are discussed.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 72
    Electronic Resource
    Electronic Resource
    Springer
    Journal of optimization theory and applications 26 (1978), S. 149-183 
    ISSN: 1573-2878
    Keywords: Geometric programming ; state of the art ; signomial programhing ; nonlinear programming ; software
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract This paper attempts to consolidate over 15 years of attempts at designing algorithms for geometric programming (GP) and its extensions. The pitfalls encountered when solving GP problems and some proposed remedies are discussed in detail. A comprehensive summary of published software for the solution of GP problems is included. Also included is a numerical comparison of some of the more promising recently developed computer codes for geometric programming on a specially chosen set of GP test problems. The relative performance of these codes is measured in terms of their robustness as well as speed of computation. The performance of some general nonlinear programming (NLP) codes on the same set of test problems is also given and compared with the results for the GP codes. The paper concludes with some suggestions for future research.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 73
    Electronic Resource
    Electronic Resource
    Springer
    Journal of optimization theory and applications 16 (1975), S. 571-571 
    ISSN: 1573-2878
    Keywords: Newton-Raphson method ; quasilinearization method ; mathematical programming ; nonlinear programming ; quadratically convergent algorithms
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract A modification to the algorithm of Ref. 1 is given.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 74
    Electronic Resource
    Electronic Resource
    Springer
    Journal of optimization theory and applications 85 (1995), S. 309-324 
    ISSN: 1573-2878
    Keywords: Nonconvex optimization ; nonlinear programming ; saddle points ; duality ; primal-dual methods
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract By an equivalent transformation using thepth power of the objective function and the constraint, a saddle point can be generated for a general class of nonconvex optimization problems. Zero duality gap is thus guaranteed when the primal-dual method is applied to the constructed equivalent form.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 75
    Electronic Resource
    Electronic Resource
    Springer
    Journal of optimization theory and applications 85 (1995), S. 575-591 
    ISSN: 1573-2878
    Keywords: Trust-region methods ; constrained optimization ; Celis-Dennis-Tapia algorithm ; successive quadratic programming algorithm ; nonlinear programming ; computational comparisons
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract In this paper, we study a modification of the Celis-Dennis-Tapia trust-region subproblem, which is obtained by replacing thel 2-norm with a polyhedral norm. The polyhedral norm Celis-Dennis-Tapia (CDT) subproblem can be solved using a standard quadratic programming code. We include computational results which compare the performance of the polyhedral-norm CDT trust-region algorithm with the performance of existing codes. The numerical results validate the effectiveness of the approach. These results show that there is not much loss of robustness or speed and suggest that the polyhedral-norm CDT algorithm may be a viable alternative. The topic merits further investigation.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 76
    Electronic Resource
    Electronic Resource
    Springer
    Journal of optimization theory and applications 90 (1996), S. 555-580 
    ISSN: 1573-2878
    Keywords: Marginal functions ; directional derivatives ; nonlinear programming
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract This paper is concerned with the Hölder properties of optimal solutions of a nonlinear programming problem with perturbations in some fixed direction. The Hölder property is used to obtain the directional derivative for the marginal function.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 77
    Electronic Resource
    Electronic Resource
    Springer
    Journal of optimization theory and applications 98 (1998), S. 83-108 
    ISSN: 1573-2878
    Keywords: Concave minimization ; reverse convex programs ; non-convex optimization ; global optimization ; test problems ; linear programming ; nonlinear programming ; computational experiments
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract This paper presents a method for constructing test problems with known global solutions for concave minimization under linear constraints with an additional convex constraint and for reverse convex programs with an additional convex constraint. The importance of such a construction can be realized from the fact that the well known d.c. programming problem can be formulated in this form. Then, the method is further extended to generate test problems with more than one convex constraint, tight or untight at the global solution.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 78
    Electronic Resource
    Electronic Resource
    Springer
    Journal of global optimization 9 (1996), S. 153-167 
    ISSN: 1573-2916
    Keywords: Reverse convex programs ; nonconvex optimization ; global optimization ; test problem generation ; linear programming ; nonlinear programming ; computational experiments
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract This paper presents computational experience with a rather straight forward implementation of an edge search algorithm for obtaining the globally optimal solution for linear programs with an additional reverse convex constraint. The paper's purpose is to provide a collection of problems, with known optimal solutions, and performance information for an edge search implementation so that researchers may have some benchmarks with which to compare new methods for reverse convex programs or concave minimization problems. There appears to be nothing in the literature that provides computational experience with a basic edge search procedure. The edge search implementation uses a depth first strategy. As such, this paper's implementation of the edge search algorithm is a modification of Hillestad's algorithm [11]. A variety of test problems is generated by using a modification of the method of Sung and Rosen [20], as well as a new method that is presented in this paper. Test problems presented may be obtained at ftp://newton.ee.ucla.edu/nonconvex/pub/.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
Close ⊗
This website uses cookies and the analysis tool Matomo. More information can be found here...