Results 11 to 20 of about 111,305 (313)
Mathematics, 2023 We adopt the alternating direction search pattern method to solve the equality and inequality constrained nonlinear optimization problems. Firstly, a new augmented Lagrangian function with a nonlinear complementarity function is proposed to transform the
Aifen Feng +3 more
doaj +1 more source
Unconstrained optimal transformation matrix [PDF]
IEEE Transactions on Aerospace and Electronic Systems, 1998 We generalize Brock's minimization of the loss function proposed by Wahba to give a least-squares estimate of satellite attitude. We follow Brock in relaxing Wahba's requirement that the minimizing attitude matrix be orthogonal, and discuss the statistical properties of our new solution and its relation to existing attitude estimation algorithms.
Landis Markley, F. +1 more
openaire +3 more sources
On Unconstrained Quasi-Submodular Function Optimization [PDF]
, 2014 With the extensive application of submodularity, its generalizations are constantly being proposed. However, most of them are tailored for special problems.
Lu, Bao-Liang, Mei, Jincheng, Zhao, Kang
core +2 more sources
Dressing the chopped-random-basis optimization: a bandwidth-limited access to the trap-free landscape [PDF]
, 2015 In quantum optimal control theory the success of an optimization algorithm is highly influenced by how the figure of merit to be optimized behaves as a function of the control field, i.e. by the control landscape.
Calarco, Tommaso +3 more
core +2 more sources
Objective acceleration for unconstrained optimization [PDF]
Numerical Linear Algebra with Applications, 2018 SummaryAcceleration schemes can dramatically improve existing optimization procedures. In most of the work on these schemes, such as nonlinear generalized minimal residual (N‐GMRES), acceleration is based on minimizing the ℓ2 norm of some target on subspaces of .
openaire +5 more sources
An Efficient Algorithm for Unconstrained Optimization [PDF]
Mathematical Problems in Engineering, 2015 This paper presents an original and efficient PSO algorithm, which is divided into three phases: (1) stabilization, (2) breadth-first search, and (3) depth-first search. The proposed algorithm, called PSO-3P, was tested with 47 benchmark continuous unconstrained optimization problems, on a total of 82 instances.
Antonin Ponsich +5 more
openaire +1 more source
An alternative globalization strategy for unconstrained optimization [PDF]
Optimization, 2017 We propose a new globalization strategy that can be used in unconstrained optimization algorithms to support rapid convergence from remote starting points. Our approach is based on using multiple points at each iteration to build a representative model of the objective function.
Öztoprak, Figen, Birbil, Ş. İlker
openaire +4 more sources
An ensemble symbiosis organisms search algorithm and its application to real world problems [PDF]
Decision Science Letters, 2017 In this study, an ensemble algorithm has been proposed, called Quasi-Oppositional Symbiosis Organisms Search (QOSOS) algorithms, by incorporating the quasi-oppositional based learning (QOBL) strategy into the newly proposed Symbiosis Organisms Search ...
Sukanta Nama, Apu Kumar Saha
doaj +1 more source
Higher-Order Optimality Conditions for Degenerate Unconstrained Optimization Problems
Journal of Optimization, Differential Equations and Their Applications, 2022 In this paper necessary and sufficient conditions of a minimum for the unconstrained degenerate optimization problem are presented. These conditions generalize the well-known optimality conditions.
Viktor Zadachyn
doaj +1 more source
Unconstrained salient object detection via proposal subset optimization [PDF]
, 2016 We aim at detecting salient objects in unconstrained images. In unconstrained images, the number of salient objects (if any) varies from image to image, and is not given. We present a salient object detection system that directly outputs a compact set of
Lin, Zhe +5 more
core +1 more source