Results 11 to 20 of about 1,105 (105)
Solving discrete zero point problems with vector labeling [PDF]
, 2005 AMS classifications: 47H10; 54H25; 55M20; 90C26; 90C33; 91B50;
Laan, G. van der +2 more
core +6 more sources
Necessary and sufficient condition on global optimality without convexity and second order differentiability [PDF]
, 2012 The main goal of this paper is to give a necessary and sufficient condition of global optimality for unconstrained optimization problems, when the objective function is not necessarily convex. We use Gâteaux differentiability of the objective function
A. Brøndsted +9 more
core +1 more source
Optimizing condition numbers [PDF]
, 2009 In this paper we study the problem of minimizing condition numbers over a compact convex subset of the cone of symmetric positive semidefinite $n\times n$ matrices. We show that the condition number is a Clarke regular strongly pseudoconvex function.
Jane J. Ye, Lewis A.S., Pierre Maréchal
core +1 more source
Global Solutions to Nonconvex Optimization of 4th-Order Polynomial and Log-Sum-Exp Functions [PDF]
, 2014 This paper presents a canonical dual approach for solving a nonconvex global optimization problem governed by a sum of fourth-order polynomial and a log-sum-exp function. Such a problem arises extensively in engineering and sciences.
Chen, Yi, Gao, David Y
core +1 more source
Integration and Optimization of Multivariate Polynomials by Restriction onto a Random Subspace [PDF]
, 2005 We consider the problem of efficient integration of an n-variate polynomial with respect to the Gaussian measure in R^n and related problems of complex integration and optimization of a polynomial on the unit sphere.
Barvinok, Alexander
core +4 more sources
No-Free-Lunch Theorems in the continuum [PDF]
, 2014 No-Free-Lunch Theorems state, roughly speaking, that the performance of all search algorithms is the same when averaged over all possible objective functions.
Alabert, Aureli +3 more
core +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
Presolving linear bilevel optimization problems
EURO Journal on Computational Optimization, 2021 Linear bilevel optimization problems are known to be strongly NP-hard and the computational techniques to solve these problems are often motivated by techniques from single-level mixed-integer optimization.
Thomas Kleinert +3 more
doaj +1 more source
Computing integral solutions of complementarity problems [PDF]
, 2005 AMS classifications: 90C33, 90C26, 91B50.
Laan, G. van der +2 more
core +9 more sources
Open Mathematics, 2017 Nowadays, nature–inspired metaheuristic algorithms are most powerful optimizing algorithms for solving the NP–complete problems. This paper proposes three approaches to find near–optimal Golomb ruler sequences based on nature–inspired algorithms in a ...
Bansal Shonak +2 more
doaj +1 more source