نتایج جستجو برای: quadratic t search method

تعداد نتایج: 2518227  

First, an integer programming model is proposed to find an α-labeling for quadratic graphs. Then, a Tabu search algorithm is developed to solve large scale problems. The proposed approach can generate α-labeling for special classes of quadratic graphs, not previously reported in the literature. Then, the main theorem of the paper is presented. We show how a problem in graph theory c...

Journal: :Numerical Lin. Alg. with Applic. 2003
Yu-Hong Dai José Mario Martínez Jin Yun Yuan

The search direction in unconstrained minimization algorithms for large scale problems is usually computed as an iterate of the (precondi-tioned) conjugate gradient method applied to the minimization of a local quadratic model. In line-search procedures this direction is required to satisfy an angle condition, that says that the angle between the negative gradient at the current point and the d...

2016
Nadir Amaioua Charles Audet Andrew R. Conn Sébastien Le Digabel

The Mesh Adaptive Direct Search algorithm (MADS) is an iterative method for constrained blackbox optimization problems. One of the optional MADS features is a versatile search step in which quadratic models are built leading to a series of quadratically constrained quadratic subproblems. This work explores different algorithms that exploit the structure of the quadratic models: the first one ap...

‎The purpose of this paper is to solve two types of Lyapunov equations and quadratic matrix equations by using the spectral representation‎. ‎We focus on solving Lyapunov equations $AX+XA^*=C$ and $AX+XA^{T}=-bb^{T}$ for $A‎, ‎X in mathbb{C}^{n times n}$ and $b in mathbb{C} ^{n times s}$ with $s < n$‎, ‎which $X$ is unknown matrix‎. ‎Also‎, ‎we suggest the new method for solving quadratic matri...

1995
P. Pardalos

A greedy randomized adaptive search procedure for the quadratic assignment problem, A new method for solving hard Sat-A greedy randomized adaptive search procedure for the 2-partition problem,

Journal: :Math. Program. 1999
Kaj Madsen Hans Bruun Nielsen Mustafa Ç. Pinar

We consider the strictly convex quadratic programming problem with bounded variables. A dual problem is derived using Lagrange duality. The dual problem is the minimization of an unconstrained, piecewise quadratic function. It involves a lower bound of λ1, the smallest eigenvalue of a symmetric, positive definite matrix, and is solved by Newton iteration with line search. The paper describes th...

2003
Ekaterina Kostina Olga Kostyukova

The paper deals with a method for solving general convex quadratic programming problems with equality and inequality constraints. The interest in such problems comes from at least two facts. First, quadratic models are widely used in real-life applications. Second, in many algorithms for nonlinear programming, a search direction is determined at each iteration as a solution of a quadratic probl...

Journal: :Optimization Methods and Software 2008
Richard H. Byrd Jorge Nocedal Richard A. Waltz

This paper reviews, extends and analyzes a new class of penalty methods for nonlinear optimization. These methods adjust the penalty parameter dynamically; by controlling the degree of linear feasibility achieved at every iteration, they promote balanced progress toward optimality and feasibility. In contrast with classical approaches, the choice of the penalty parameter ceases to be a heuristi...

2014
Paraskevi Katsiampa

The analysis of time series has long been the subject of interest in different fields. For decades time series were analysed with linear models. Nevertheless, an issue that has been raised is whether there exist other models that can explain and fit real data better than linear ones. In this paper, new nonlinear time series models are proposed (namely the ExpAR-ARCH and the ExpAR-GARCH), which ...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید