### A BSSS algorithm for the location problem with minimum square error.

Skip to main content (access key 's'),
Skip to navigation (access key 'n'),
Accessibility information (access key '0')

In this paper, a new hybrid simulated annealing algorithm for constrained global optimization is proposed. We have developed a stochastic algorithm called ASAPSPSA that uses Adaptive Simulated Annealing algorithm (ASA). ASA is a series of modifications to the basic simulated annealing algorithm (SA) that gives the region containing the global solution of an objective function. In addition, Simultaneous Perturbation Stochastic Approximation (SPSA)...

We present below a new series of conjectures and open problems in the fields of (global) Optimization and Matrix analysis, in the same spirit as our recently published paper [J.-B. Hiriart-Urruty, Potpourri of conjectures and open questions in Nonlinear analysis and Optimization. SIAM Review 49 (2007) 255–273]. With each problem come a succinct presentation, a list of specific references, and a view on the state of the art of the subject.

We present below a new series of conjectures and open problems in the fields of (global) Optimization and Matrix analysis, in the same spirit as our recently published paper [J.-B. Hiriart-Urruty, Potpourri of conjectures and open questions in Nonlinear analysis and Optimization. SIAM Review49 (2007) 255–273]. With each problem come a succinct presentation, a list of specific references, and a view on the state of the art of the subject.

This paper is concerned with the stabilisation of linear time-delay systems by tuning a finite number of parameters. Such problems typically arise in the design of fixed-order controllers. As time-delay systems exhibit an infinite amount of characteristic roots, a full assignment of the spectrum is impossible. However, if the system is stabilisable for the given parameter set, stability can in principle always be achieved through minimising the real part of the rightmost characteristic root, or...

This paper is concerned with the stabilisation of linear time-delay systems by tuning a finite number of parameters. Such problems typically arise in the design of fixed-order controllers. As time-delay systems exhibit an infinite amount of characteristic roots, a full assignment of the spectrum is impossible. However, if the system is stabilisable for the given parameter set, stability can in principle always be achieved through minimising the real part of the rightmost characteristic...

The aim of this short contribution is to point out some applications of systems of so called two-sided $(max,min)$-linear systems of equations and inequalities of [Gavalec, M., Zimmermann, K.: Solving systems of two-sided (max,min)-linear equations Kybernetika 46 (2010), 405–414.] to solving some fuzzy set multiple fuzzy goal problems. The paper describes one approach to formulating and solving multiple fuzzy goal problems. The fuzzy goals are given as fuzzy sets and we look for a fuzzy set, the fuzzy intersections...

In the present note we consider the definitions and properties of locally pseudo- and quasiconvex functions and give a sufficient condition for a locally quasiconvex function at a point x ∈ Rn, to be also locally pseudoconvex at the same point.

We study polyconvex envelopes of a class of functions related to the function of Kohn and Strang introduced in . We present an example of a function of this class for which the polyconvex envelope may be computed explicitly and we also point out some general features of the problem.

A new approach for obtaining the second order sufficient conditions for nonlinear mathematical programming problems which makes use of second order derivative is presented. In the so-called second order $\eta $-approximation method, an optimization problem associated with the original nonlinear programming problem is constructed that involves a second order $\eta $-approximation of both the objective function and the constraint function constituting the original problem. The equivalence between the nonlinear...

The article deals with certain nonconvex optimization problem which have features analogous to those of the linear optimization problems. We can find their absolute extrema and the set all optimal points of such nonconvex optimization problem represents the closure of a face of a spherical polyhedron which is its feasible set.