Results 1 - 10
of
28
Global minimization using an Augmented Lagrangian method with variable lower-level constraints
, 2007
"... A novel global optimization method based on an Augmented Lagrangian framework is introduced for continuous constrained nonlinear optimization problems. At each outer iteration k the method requires the εk-global minimization of the Augmented Lagrangian with simple constraints, where εk → ε. Global c ..."
Abstract
-
Cited by 39 (1 self)
- Add to MetaCart
A novel global optimization method based on an Augmented Lagrangian framework is introduced for continuous constrained nonlinear optimization problems. At each outer iteration k the method requires the εk-global minimization of the Augmented Lagrangian with simple constraints, where εk → ε. Global convergence to an ε-global minimizer of the original problem is proved. The subproblems are solved using the αBB method. Numerical experiments are presented.
Derivative-free optimization: A review of algorithms and comparison of software implementations
"... ..."
GloptLab, a configurable framework for the rigorous global solution of quadratic constraint satisfaction problems
"... solution of quadratic constraint satisfaction problems ..."
Abstract
-
Cited by 12 (8 self)
- Add to MetaCart
(Show Context)
solution of quadratic constraint satisfaction problems
Transposition theorems and qualification-free optimality conditions
- SIAM J. OPTIMIZATION
, 2006
"... New theorems of the alternative for polynomial constraints (based on the Positivstellensatz from real algebraic geometry) and for linear constraints (generalizing the transposition theorems of Motzkin and Tucker) are proved. Based on these, two Karush-John optimality conditions – holding without an ..."
Abstract
-
Cited by 7 (3 self)
- Add to MetaCart
(Show Context)
New theorems of the alternative for polynomial constraints (based on the Positivstellensatz from real algebraic geometry) and for linear constraints (generalizing the transposition theorems of Motzkin and Tucker) are proved. Based on these, two Karush-John optimality conditions – holding without any constraint qualification – are proved for single- or multi-objective constrained optimization problems. The first condition applies to polynomial optimization problems only, and gives for the first time necessary and sufficient global optimality conditions for polynomial problems. The second condition applies to smooth local optimization problems and strengthens known local conditions. If some linear or concave constraints are present, the new version reduces the number of constraints for which a constraint qualification is needed to get the Kuhn-Tucker conditions.
Validated linear relaxations and preprocessing: Some experiments
- SIAM J. OPTIM
, 2005
"... Based on work originating in the early 1970s, a number of recent global optimization algorithms have relied on replacing an original nonconvex nonlinear program by convex or linear relaxations. Such linear relaxations can be generated automatically through an automatic differentiation process. Thi ..."
Abstract
-
Cited by 5 (3 self)
- Add to MetaCart
Based on work originating in the early 1970s, a number of recent global optimization algorithms have relied on replacing an original nonconvex nonlinear program by convex or linear relaxations. Such linear relaxations can be generated automatically through an automatic differentiation process. This process decomposes the objective and constraints (if any) into convex and nonconvex unary and binary operations. The convex operations can be approximated arbitrarily well by appending additional constraints, while the domain must somehow be subdivided (in an overall branch-and-bound process or in some other local process) to handle nonconvex constraints. In general, a problem can be hard if even a single nonconvex term appears. However, certain nonconvex terms lead to easier-to-solve problems than others. Recently, Neumaier, Lebbah, Michel, ourselves, and others have paved the way to utilizing such techniques in a validated context. In this paper, we present a symbolic preprocessing step that provides a measure of the intrinsic difficulty of a problem. Based on this step, one of two methods can be chosen to relax nonconvex terms. This preprocessing step is similar to a method previously proposed by Epperly and Pistikopoulos [J. Global Optim., 11 (1997), pp. 287–311] for determining subspaces in which to branch, but we present it from a different point of view that is amenable to simplification of the problem presented to the linear programming solver, and within a validated context. Besides an illustrative example, we have implemented general relaxations in a validated context, as well as the preprocessing technique, and we present experiments on a standard test set. Finally, we present conclusions.
Radio resource allocation for singlenetwork and multi-homing services in heterogeneous wireless access medium,”
- IEEE VTC
, 2012
"... Abstract-This paper studies radio resource allocation for mobile terminals (MTs) in a heterogeneous wireless access medium. Unlike the existing solutions in literature, we consider the simultaneous presence of both single-network and multi-homing services in the networking environment. In single-ne ..."
Abstract
-
Cited by 5 (3 self)
- Add to MetaCart
(Show Context)
Abstract-This paper studies radio resource allocation for mobile terminals (MTs) in a heterogeneous wireless access medium. Unlike the existing solutions in literature, we consider the simultaneous presence of both single-network and multi-homing services in the networking environment. In single-network services, an MT is assigned to the best wireless access network available at its location. On the other hand, in multi-homing services, an MT utilizes all available wireless access networks simultaneously. The objective of the radio resource allocation is of twofold: to determine the optimal assignment of MTs with single-network service to the available wireless access networks, and to find the corresponding optimal bandwidth allocation to the MTs with single-network and multi-homing services. We develop a sub-optimal decentralized implementation of the radio resource allocation, which relies on network cooperation to perform the allocation in a dynamic environment in an efficient manner. The MT plays an active role in the resource allocation operation, whether by selecting the best available wireless network for single-network services or by determining the required bandwidth share from each available network for multi-homing services. Simulation results are presented to demonstrate the performance of the proposed algorithm.
The Optimization Test Environment
"... Testing is a crucial part of software development in general, and hence also in mathematical programming. Unfortunately, it is often a time consuming and little exciting activity. This naturally motivated us to increase the e ciency in testing solvers for optimization problems and to automatize as m ..."
Abstract
-
Cited by 4 (4 self)
- Add to MetaCart
(Show Context)
Testing is a crucial part of software development in general, and hence also in mathematical programming. Unfortunately, it is often a time consuming and little exciting activity. This naturally motivated us to increase the e ciency in testing solvers for optimization problems and to automatize as much of the procedure as possible. Keywords: test environment, optimization, solver benchmarking, solver comparison The testing procedure typically consists of three basic tasks: a) organize test problem sets, also called test libraries; b) solve selected test problems with selected solvers; c) analyze, check and compare the results. The Test Environment is a graphical user interface (GUI) that enables to manage the tasks a) and b) interactively, and task c) automatically. The Test Environment is particularly designed for users who seek to 1. adjust solver parameters, or 2. compare solvers on single problems, or 3. evaluate solvers on suitable test sets.
Improved and simplified validation of feasible points: Inequality and equality constrained problems
- Mathematical Programming, submitted
, 2005
"... Abstract. In validated branch and bound algorithms for global optimization, upper bounds on the global optimum are obtained by evaluating the objective at an approximate optimizer; the upper bounds are then used to eliminate subregions of the search space. For constrained optimization, in general, a ..."
Abstract
-
Cited by 3 (1 self)
- Add to MetaCart
(Show Context)
Abstract. In validated branch and bound algorithms for global optimization, upper bounds on the global optimum are obtained by evaluating the objective at an approximate optimizer; the upper bounds are then used to eliminate subregions of the search space. For constrained optimization, in general, a small region must be constructed within which existence of a feasible point can be proven, and an upper bound on the objective over that region is obtained. We had previously proposed a perturbation technique for constructing such a region. In this work, we propose a much simplified and improved technique, based on an orthogonal decomposition of the normal space to the constraints. In purely inequality constrained problems, a point, rather than a region, can be used, and, for equality and inequality constrained problems, the region lies in a smaller-dimensional subspace, giving rise to sharper upper bounds. Numerical experiments on published test sets for global optimization provide evidence of the superiority of the new approach within our GlobSol environment. 1.
Improving interval enclosures
, 2009
"... This paper serves as background information for the Vienna proposal for interval standardization, explaining what is needed in practice to make competent use of the interval arithmetic provided by an implementation of the standard to be. Discussed are methods to improve the quality of interval encl ..."
Abstract
-
Cited by 3 (0 self)
- Add to MetaCart
(Show Context)
This paper serves as background information for the Vienna proposal for interval standardization, explaining what is needed in practice to make competent use of the interval arithmetic provided by an implementation of the standard to be. Discussed are methods to improve the quality of interval enclosures of the range of a function over a box, considerations of possible hardware support facilitating the implementation of such methods, and the results of a simple interval challenge that I had posed to the reliable computing mailing list on November 26, 2008. Also given is an example of a bound constrained global optimization problem in 4 variables that has a 2-dimensional continuum of global minimizers. This makes standard branch and bound codes extremely slow, and therefore may serve as a useful degenerate test problem.