Results 21 to 30 of about 1,344 (121)
A global method for some class of optimization and control problems
International Journal of Mathematics and Mathematical Sciences, Volume 23, Issue 9, Page 605-616, 2000., 2000 The problem of maximizing a nonsmooth convex function over an arbitrary set is considered. Based on the optimality condition obtained by Strekalovsky in 1987 an algorithm for solving the problem is proposed. We show that the algorithm can be applied to the nonconvex optimal control problem as well.
R. Enkhbat
wiley +1 more source
Restrict-and-relax search for 0-1 mixed-integer programs
EURO Journal on Computational Optimization, 2013 A highly desirable characteristic of methods for solving 0-1 mixed-integer programs is that they should be capable of producing high-quality solutions quickly.
Menal Guzelsoy +2 more
doaj +1 more source
CSIAM Transaction on Applied Mathematics, 2020 An implicit evaluation method of vector 2-norms is presented for function evaluations arising from sphere constrained quadratic optimizations. The efficiency of the method in terms of computational costs mainly comes from the well-known shifted conjugate
T. Suzuki
semanticscholar +1 more source
Results in Applied Mathematics, 2019 In this article, we propose a three-term conjugate gradient projection algorithm for solving constrained monotone nonlinear equations. The global convergence of the algorithm was established under suitable assumptions.
Auwal Bala Abubakar +2 more
doaj +1 more source
On some p-almost Hadamard matrices
Operators and Matrices, 2019 Let M(n,R) be the space of all real valued n× n matrices and O(n,R) be the orthogonal group. A square matrix Hn ∈ M(n,R) is called “almost Hadamard” if Un := Hn/ √ n is orthogonal, and locally maximizes the 1-norm on O(n,R) . The matrix Hn is “ p -almost
M. T. Mohan
semanticscholar +1 more source
Convergence analysis of the iterative methods for quasi complementarity problems
International Journal of Mathematics and Mathematical Sciences, Volume 11, Issue 2, Page 319-334, 1988., 1988 In this paper, we consider the iterative methods for the quasi complementarity problems of the form where m is a point‐to‐point mapping and T is a continuous mapping from Rn into itself. The algorithms considered in this paper are general and unified ones, which include many existing algorithms as special cases for solving the complementarity problems.
Muhammad Aslam Noor
wiley +1 more source
Branch-delete-bound algorithm for globally solving quadratically constrained quadratic programs
Open Mathematics, 2017 This paper presents a branch-delete-bound algorithm for effectively solving the global minimum of quadratically constrained quadratic programs problem, which may be nonconvex.
Hou Zhisong +3 more
doaj +1 more source
Acceleration of the Halpern algorithm to search for a fixed point of a nonexpansive mapping
, 2014 This paper presents an algorithm to accelerate the Halpern fixed point algorithm in a real Hilbert space. To this goal, we first apply the Halpern algorithm to the smooth convex minimization problem, which is an example of a fixed point problem for a ...
Kaito Sakurai, Hideaki Iiduka
semanticscholar +1 more source
A New Filled Function for Global Optimization
Analele Stiintifice ale Universitatii Ovidius Constanta: Seria Matematica, 2023 The filled function method has recently become very popular in optimization theory, as it is an e cient and e ective method for finding the global minimizer of multimodal functions.
Şahiner Ahmet +2 more
doaj +1 more source
About the Algebraic Solutions of Smallest Enclosing Cylinders Problems [PDF]
, 2011 Given n points in Euclidean space E^d, we propose an algebraic algorithm to compute the best fitting (d-1)-cylinder. This algorithm computes the unknown direction of the axis of the cylinder.
E. Schömer +11 more
core +1 more source