446 results
Search Results
2. COAP 2012 Best Paper Prize.
- Subjects
MATHEMATICAL optimization ,QUADRATIC programming - Abstract
The article offers information that the research paper "A Nonmonotone Filter Method for Nonlinear Optimization" by Chungen Shen of Shanghai Finance University in China, Sven Leyffer of Argonne National Laboratory and Roger Fletcher of the University of Dundee has won the 2012 Best Paper Award by the journal in November 2013. It states that the paper describes a sequential quadratic programming (SQP) method and introduces a nonmonotone filter method for nonlinear optimization.
- Published
- 2013
- Full Text
- View/download PDF
3. COAP 2014 Best Paper Prize.
- Subjects
LINEAR programming ,VALUE at risk ,COMPUTER algorithms ,RESEARCH awards ,APPROXIMATION algorithms ,MATHEMATICAL optimization ,PRODUCTION scheduling - Abstract
The article focuses on the paper "A primal-dual aggregation algorihtm for minimizing conditional value-at-risk in linear programs," by Daniel Espinoza and Eduardo Moreno which won the Computational Optimization and Applications (COAP) Best Paper Award. Topics discussed include the approximation method for stochastic optimization problems, the conditional value at risk (CvaR), and production scheduling problems.
- Published
- 2015
- Full Text
- View/download PDF
4. COAP 2009 best paper award.
- Subjects
MATHEMATICAL periodicals ,MATHEMATICAL optimization ,PUBLICATION awards ,PERIODICAL editors ,INTEGER programming ,ALGORITHMS ,APPROXIMATION theory - Published
- 2010
- Full Text
- View/download PDF
5. COAP 2005 Best Paper Award.
- Subjects
MATHEMATICAL programming ,LINEAR programming ,LINEAR substitutions ,LINEAR systems ,MATHEMATICAL optimization ,MATHEMATICAL analysis ,COMPLEX matrices - Abstract
The article discusses the 2005 best paper awardee of the Computational Optimization and Applications entitled "Hyper-Sparsity in the Revised Simplex Method and How to Exploit It," by Julian Hall and Ken McKinnon of the University of Edinburgh, Scotland. The continuity in the sparsity of the right -hand-side was initially denoted as super-sparsity. The authors observed that the same behaviour was detected when applying the basis matrix factors to the two linear systems that are solved in each process of the revised simple system. For linear programming problems that exhibit hyper-sparsity, the value of it will count on the performance of those elements.
- Published
- 2006
- Full Text
- View/download PDF
6. COAP 2004 Best Paper Award.
- Author
-
Bergamaschi, Luca, Gondzio, Jacek, and Zilli, Giovanni
- Subjects
PROGRAM transformation ,AWARDS ,MATHEMATICAL optimization ,COMPUTER programming - Abstract
Announces that the Best Paper Award for 2004 is the piece "Preconditioning Indefinite Systems in Interior Point Methods for Optimization," by Luca Bergamaschi and Jacek Gondzio, as chosen by the editorial board of the periodical "Computational Optimization and Applications". History of the authors' development of the research paper; Contributions of the paper to the field of computational optimization.
- Published
- 2005
- Full Text
- View/download PDF
7. Guest editorial.
- Author
-
Pillo, Gianni and Roma, Massimo
- Subjects
ALGORITHMS ,MATHEMATICAL optimization ,CONSTRAINTS (Physics) - Abstract
An introduction is presented in which the editors discuss various reports within the issue on topics including algorithms for unconstrained optimization assuming that the objective function is differentiable but its derivatives are not available, bound constrained mixed-integer optimization problems, and an active set method for the minimization of a function subject to bound constraints.
- Published
- 2012
- Full Text
- View/download PDF
8. A two-level distributed algorithm for nonconvex constrained optimization.
- Author
-
Sun, Kaizhao and Sun, X. Andy
- Subjects
CONSTRAINED optimization ,NONCONVEX programming ,DISTRIBUTED algorithms ,ELECTRICAL load ,ELECTRIC networks ,ELECTRIC power ,MATHEMATICAL optimization - Abstract
This paper aims to develop distributed algorithms for nonconvex optimization problems with complicated constraints associated with a network. The network can be a physical one, such as an electric power network, where the constraints are nonlinear power flow equations, or an abstract one that represents constraint couplings between decision variables of different agents. Despite the recent development of distributed algorithms for nonconvex programs, highly complicated constraints still pose a significant challenge in theory and practice. We first identify some difficulties with the existing algorithms based on the alternating direction method of multipliers (ADMM) for dealing with such problems. We then propose a reformulation that enables us to design a two-level algorithm, which embeds a specially structured three-block ADMM at the inner level in an augmented Lagrangian method framework. Furthermore, we prove the global and local convergence as well as iteration complexity of this new scheme for general nonconvex constrained programs, and show that our analysis can be extended to handle more complicated multi-block inner-level problems. Finally, we demonstrate with computation that the new scheme provides convergent and parallelizable algorithms for various nonconvex applications, and is able to complement the performance of the state-of-the-art distributed algorithms in practice by achieving either faster convergence in optimality gap or in feasibility or both. [ABSTRACT FROM AUTHOR]
- Published
- 2023
- Full Text
- View/download PDF
9. A primal-dual interior-point method based on various selections of displacement step for symmetric optimization.
- Author
-
Alzalg, Baha
- Subjects
INTERIOR-point methods ,MATHEMATICAL optimization ,ALGORITHMS ,COMPUTER programming ,PROBLEM solving - Abstract
In this paper, we develop a primal-dual central trajectory interior-point algorithm for symmetric programming problems and establish its complexity analysis. The main contribution of the paper is that it uniquely equips the central trajectory algorithm with various selections of the displacement step while solving symmetric programming. To show the efficiency of the proposed algorithm, these selections of calculating the displacement step are compared in numerical examples for second-order cone programming, which is a special case of symmetric programming. [ABSTRACT FROM AUTHOR]
- Published
- 2019
- Full Text
- View/download PDF
10. Direct trajectory optimization and costate estimation of finite-horizon and infinite-horizon optimal control problems using a Radau pseudospectral method.
- Author
-
Garg, Divya, Patterson, Michael, Francolin, Camila, Darby, Christopher, Huntington, Geoffrey, Hager, William, and Rao, Anil
- Subjects
TRAJECTORY optimization ,NONLINEAR programming ,POLYNOMIALS ,MATHEMATICAL programming ,MATHEMATICAL optimization - Abstract
method is presented for direct trajectory optimization and costate estimation of finite-horizon and infinite-horizon optimal control problems using global collocation at Legendre-Gauss-Radau (LGR) points. A key feature of the method is that it provides an accurate way to map the KKT multipliers of the nonlinear programming problem to the costates of the optimal control problem. More precisely, it is shown that the dual multipliers for the discrete scheme correspond to a pseudospectral approximation of the adjoint equation using polynomials one degree smaller than that used for the state equation. The relationship between the coefficients of the pseudospectral scheme for the state equation and for the adjoint equation is established. Also, it is shown that the inverse of the pseudospectral LGR differentiation matrix is precisely the matrix associated with an implicit LGR integration scheme. Hence, the method presented in this paper can be thought of as either a global implicit integration method or a pseudospectral method. Numerical results show that the use of LGR collocation as described in this paper leads to the ability to determine accurate primal and dual solutions for both finite and infinite-horizon optimal control problems. [ABSTRACT FROM AUTHOR]
- Published
- 2011
- Full Text
- View/download PDF
11. Polyhedral analysis and a new algorithm for the length constrained K–drones rural postman problem.
- Author
-
Campbell, James, Corberán, Ángel, Plana, Isaac, Sanchis, José M., and Segura, Paula
- Subjects
HEURISTIC algorithms ,TRAVEL restrictions ,ALGORITHMS ,MATHEMATICAL optimization ,COMBINATORIAL optimization ,VEHICLE routing problem ,POLYHEDRA - Abstract
The Length Constrained K–Drones Rural Postman Problem (LC K–DRPP) is a continuous optimization problem where a set of curved or straight lines of a network have to be traversed, in order to be serviced, by a fleet of homogeneous drones, with total minimum cost. Since the range and endurance of drones is limited, we consider here that the length of each route is constrained to a given limit L. Drones are not restricted to travel on the network, and they can enter and exit a line through any of its points, servicing only a portion of that line. Therefore, shorter solutions are obtained with "aerial" drones than with "ground" vehicles that are restricted to the network. If a LC K–DRPP instance is digitized by approximating each line with a polygonal chain, and it is assumed that drones can only enter and exit a line through the points of the chain, an instance of the Length Constrained K–vehicles Rural Postman Problem (LC K–RPP) is obtained. This is a discrete arc routing problem, and therefore can be solved with combinatorial optimization techniques. However, when the number of points in each polygonal chain is very large, the LC K–RPP instance can be so large that it is very difficult to solve, even for heuristic algorithms. Therefore, it is necessary to implement a procedure that generates smaller LC K–RPP instances by approximating each line by a few but "significant" points and segments. In this paper, we present a new formulation for the LC K–RPP with two binary variables for each edge and each drone representing the first and second traversals of the edge, respectively. We make a polyhedral study of the set of solutions of a relaxed formulation and prove that several families of inequalities induce facets of the polyhedron. We design and implement a branch–and–cut algorithm for the LC K–RPP that incorporates the separation of these inequalities. This B &C is the main routine of an iterative algorithm that, by solving a LC K–RPP instance at each step, finds good solutions for the original LC K–DRPP. The computational results show that the proposed method is effective in finding good solutions for LC K–DRPP, and that the branch–and–cut algorithm for the LC K–RPP outperforms the only published exact method for this problem. [ABSTRACT FROM AUTHOR]
- Published
- 2022
- Full Text
- View/download PDF
12. DC Semidefinite programming and cone constrained DC optimization I: theory.
- Author
-
Dolgopolik, M. V.
- Subjects
SEMIDEFINITE programming ,MATHEMATICAL optimization ,CONES ,CONSTRAINED optimization ,NONLINEAR programming ,EIGENVALUES - Abstract
In this two-part study, we discuss possible extensions of the main ideas and methods of constrained DC optimization to the case of nonlinear semidefinite programming problems and more general nonlinear cone constrained optimization problems. In the first paper, we analyse two different approaches to the definition of DC matrix-valued functions (namely, order-theoretic and componentwise), study some properties of convex and DC matrix-valued mappings and demonstrate how to compute DC decompositions of some nonlinear semidefinite constraints appearing in applications. We also compute a DC decomposition of the maximal eigenvalue of a DC matrix-valued function. This DC decomposition can be used to reformulate DC semidefinite constraints as DC inequality constrains. Finally, we study local optimality conditions for general cone constrained DC optimization problems. [ABSTRACT FROM AUTHOR]
- Published
- 2022
- Full Text
- View/download PDF
13. A derivative-free optimization algorithm for the efficient minimization of functions obtained via statistical averaging.
- Author
-
Beyhaghi, Pooriya, Alimo, Ryan, and Bewley, Thomas
- Subjects
MATHEMATICAL optimization ,STATIONARY processes ,GLOBAL optimization ,ARITHMETIC mean - Abstract
This paper considers the efficient minimization of the infinite time average of a stationary ergodic process in the space of a handful of design parameters which affect it. Problems of this class, derived from physical or numerical experiments which are sometimes expensive to perform, are ubiquitous in engineering applications. In such problems, any given function evaluation, determined with finite sampling, is associated with a quantifiable amount of uncertainty, which may be reduced via additional sampling. The present paper proposes a new optimization algorithm to adjust the amount of sampling associated with each function evaluation, making function evaluations more accurate (and, thus, more expensive), as required, as convergence is approached. The work builds on our algorithm for Delaunay-based Derivative-free Optimization via Global Surrogates (Δ -DOGS, see JOGO 10.1007/s10898-015-0384-2). The new algorithm, dubbed α -DOGS, substantially reduces the overall cost of the optimization process for problems of this important class. Further, under certain well-defined conditions, rigorous proof of convergence to the global minimum of the problem considered is established. [ABSTRACT FROM AUTHOR]
- Published
- 2020
- Full Text
- View/download PDF
14. A novel hybrid trust region algorithm based on nonmonotone and LOOCV techniques.
- Author
-
Ahmadvand, M., Esmaeilbeigi, M., Kamandi, A., and Yaghoobi, F. M.
- Subjects
ALGORITHMS ,RADIAL basis functions ,INTERPOLATION ,MATHEMATICAL optimization ,STOCHASTIC convergence - Abstract
In this paper, a novel hybrid trust-region algorithm using radial basis function (RBF) interpolations is proposed. The new algorithm is an improved version of ORBIT algorithm based on two novel ideas. Because the accuracy and stability of RBF interpolation depends on a shape parameter, so it is more appropriate to select this parameter according to the optimization problem. In the new algorithm, the appropriate shape parameter value is determined according to the optimization problem based on an effective statistical approach, while the ORBIT algorithm in all problems uses a fixed shape parameter value. In addition, the new algorithm is equipped with a new intelligent nonmonotone strategy which improves the speed of convergence, while the monotonicity of the sequence of objective function values in the ORBIT may decrease the rate of convergence, especially when an iteration is trapped near a narrow curved valley. The global convergence of the new hybrid algorithm is analyzed under some mild assumptions. The numerical results significantly indicate the superiority of the new algorithm compared with the original version. [ABSTRACT FROM AUTHOR]
- Published
- 2019
- Full Text
- View/download PDF
15. A new reduced gradient method for solving linearly constrained multiobjective optimization problems.
- Author
-
El Moudden, Mustapha and El Ghali, Ahmed
- Subjects
CONJUGATE gradient methods ,MATHEMATICAL optimization ,BISECTORS (Geometry) ,NONLINEAR programming - Abstract
In this paper, we consider the linearly constrained multiobjective minimization, and we propose a new reduced gradient method for solving this problem. Our approach solves iteratively a convex quadratic optimization subproblem to calculate a suitable descent direction for all the objective functions, and then use a bisection algorithm to find an optimal stepsize along this direction. We prove, under natural assumptions, that the proposed algorithm is well-defined and converges globally to Pareto critical points of the problem. Finally, this algorithm is implemented in the MATLAB environment and comparative results of numerical experiments are reported. [ABSTRACT FROM AUTHOR]
- Published
- 2018
- Full Text
- View/download PDF
16. Outdoor WLAN planning via non-monotone derivative-free optimization: algorithm adaptation and case study.
- Author
-
González-Castaño, Francisco J., Costa-Montenegro, Enrique, Burguillo-Rial, Juan C., and García-Palomares, Ubaldo
- Subjects
WIRELESS LANs ,MATHEMATICAL optimization ,ALGORITHMS ,SIMULATED annealing ,STOCHASTIC convergence ,MOBILE communication systems - Abstract
In this paper, we study the application of non-monotone derivative-free optimization algorithms to wireless local area networks (WLAN) planning, which can be modeled as an unconstrained minimization problem. We wish to determine the access point (AP) positions that maximize coverage in order to provide connectivity to static and mobile users. As the objective function of the optimization model is not everywhere differentiable, previous research has discarded gradient methods and employed heuristics such as neighborhood search (NS) and simulated annealing (SA). In this paper, we show that the model fulfills the conditions required by recently proposed non-monotone derivative-free (DF) algorithms. Unlike SA, DF has guaranteed convergence. The numerical tests reveal that a tailored DF implementation (termed "zone search") outperforms NS and SA. [ABSTRACT FROM AUTHOR]
- Published
- 2008
- Full Text
- View/download PDF
17. Accelerating convergence of a globalized sequential quadratic programming method to critical Lagrange multipliers.
- Author
-
Izmailov, A. F.
- Subjects
QUADRATIC programming ,CONSTRAINT satisfaction ,MATHEMATICAL optimization ,ALGORITHMS ,LAGRANGE multiplier ,HESSIAN matrices ,EXTRAPOLATION - Abstract
This paper concerns the issue of asymptotic acceptance of the true Hessian and the full step by the sequential quadratic programming algorithm for equality-constrained optimization problems. In order to enforce global convergence, the algorithm is equipped with a standard Armijo linesearch procedure for a nonsmooth exact penalty function. The specificity of considerations here is that the standard assumptions for local superlinear convergence of the method may be violated. The analysis focuses on the case when there exist critical Lagrange multipliers, and does not require regularity assumptions on the constraints or satisfaction of second-order sufficient optimality conditions. The results provide a basis for application of known acceleration techniques, such as extrapolation, and allow the formulation of algorithms that can outperform the standard SQP with BFGS approximations of the Hessian on problems with degenerate constraints. This claim is confirmed by some numerical experiments. [ABSTRACT FROM AUTHOR]
- Published
- 2021
- Full Text
- View/download PDF
18. Planar methods and grossone for the Conjugate Gradient breakdown in nonlinear programming.
- Author
-
De Leone, Renato, Fasano, Giovanni, and Sergeyev, Yaroslav D.
- Subjects
NONLINEAR programming ,LINEAR systems ,PROBLEM solving ,MATHEMATICAL optimization ,NUMERICAL analysis - Abstract
This paper deals with an analysis of the Conjugate Gradient (CG) method (Hestenes and Stiefel in J Res Nat Bur Stand 49:409-436,
1952 ), in the presence of degenerates on indefinite linear systems. Several approaches have been proposed in the literature to issue the latter drawback in optimization frameworks, including reformulating the original linear system or recurring to approximately solving it. All the proposed alternatives seem to rely on algebraic considerations, and basically pursue the idea of improving numerical efficiency. In this regard, here we sketch two separate analyses for the possible CG degeneracy. First, we start detailing a more standard algebraic viewpoint of the problem, suggested by planar methods. Then, another algebraic perspective is detailed, relying on a novel recently proposed theory, which includes an additional number, namely grossone. The use of grossone allows to work numerically with infinities and infinitesimals. The results obtained using the two proposed approaches perfectly match, showing that grossone may represent a fruitful and promising tool to be exploited within Nonlinear Programming. [ABSTRACT FROM AUTHOR]- Published
- 2018
- Full Text
- View/download PDF
19. Proximal algorithms and temporal difference methods for solving fixed point problems.
- Author
-
Bertsekas, Dimitri P.
- Subjects
ALGORITHMS ,FIXED point theory ,MATHEMATICAL analysis ,MATHEMATICAL optimization ,ITERATIVE methods (Mathematics) - Abstract
In this paper we consider large fixed point problems and solution with proximal algorithms. We show that for linear problems there is a close connection between proximal iterations, which are prominent in numerical analysis and optimization, and multistep methods of the temporal difference type such as TD(λ
), LSTD(λ ), and LSPE(λ ), which are central in simulation-based exact and approximate dynamic programming. One benefit of this connection is a new and simple way to accelerate the standard proximal algorithm by extrapolation towards a multistep iteration, which generically has a faster convergence rate. Another benefit is the potential for integration into the proximal algorithmic context of several new ideas that have emerged in the approximate dynamic programming context, including simulation-based implementations. Conversely, the analytical and algorithmic insights from proximal algorithms can be brought to bear on the analysis and the enhancement of temporal difference methods. We also generalize our linear case result to nonlinear problems that involve a contractive mapping, thus providing guaranteed and potentially substantial acceleration of the proximal and forward backward splitting algorithms at no extra cost. Moreover, under certain monotonicity assumptions, we extend the connection with temporal difference methods to nonlinear problems through a linearization approach. [ABSTRACT FROM AUTHOR] - Published
- 2018
- Full Text
- View/download PDF
20. A convergent relaxation of the Douglas-Rachford algorithm.
- Author
-
Thao, Nguyen Hieu
- Subjects
ALGORITHMS ,MATHEMATICAL optimization ,STOCHASTIC convergence ,NUMERICAL analysis ,PROBLEM solving - Abstract
This paper proposes an algorithm for solving structured optimization problems, which covers both the backward-backward and the Douglas-Rachford algorithms as special cases, and analyzes its convergence. The set of fixed points of the corresponding operator is characterized in several cases. Convergence criteria of the algorithm in terms of general fixed point iterations are established. When applied to nonconvex feasibility including potentially inconsistent problems, we prove local linear convergence results under mild assumptions on regularity of individual sets and of the collection of sets. In this special case, we refine known linear convergence criteria for the Douglas-Rachford (DR) algorithm. As a consequence, for feasibility problem with one of the sets being affine, we establish criteria for linear and sublinear convergence of convex combinations of the alternating projection and the DR methods. These results seem to be new. We also demonstrate the seemingly improved numerical performance of this algorithm compared to the RAAR algorithm for both consistent and inconsistent sparse feasibility problems. [ABSTRACT FROM AUTHOR]
- Published
- 2018
- Full Text
- View/download PDF
21. The geo-graph in practice: creating United States Congressional Districts from census blocks.
- Author
-
King, D. M., Jacobson, S. H., and Sewell, E. C.
- Subjects
MATHEMATICAL optimization ,HEURISTIC algorithms ,EDGES (Geometry) ,SEARCH algorithms ,PLANAR graphs - Abstract
Every 10 years, United States Congressional Districts must be redesigned in response to a national census. While the size of practical political districting problems is typically too large for exact optimization approaches, heuristics such as local search can help stakeholders quickly identify good (but suboptimal) plans that suit their objectives. However, enforcing a district contiguity constraint during local search can require significant computation; tools that can reduce contiguity-based computations in large practical districting problems are needed. This paper applies the geo-graph framework to the creation of United States Congressional Districts from census blocks in four states-Arizona, Massachusetts, New Mexico, and New York-and finds that (a) geo-graph contiguity assessment algorithms reduce the average number of edges visited during contiguity assessments by at least three orders of magnitude in every problem instance when compared with simple graph search, and (b) the assumptions of the geo-graph model are easily adapted to the sometimes-irregular census block geography with only superficial impact on the solution space. These results show that the geo-graph model and its associated contiguity algorithms provide a powerful constraint assessment tool to political districting stakeholders. [ABSTRACT FROM AUTHOR]
- Published
- 2018
- Full Text
- View/download PDF
22. An accelerated nonmonotone trust region method with adaptive trust region for unconstrained optimization.
- Author
-
Liu, Jianjun, Xu, Xiangmin, and Cui, Xuehui
- Subjects
MATHEMATICAL optimization ,STOCHASTIC convergence ,HESSIAN matrices ,ITERATED integrals ,STOCHASTIC processes - Abstract
Trust region method is a robust method for optimization problems. In this paper, we propose a novel adaptive nonmonotone technique based on trust region methods for solving unconstrained optimization. In order to accelerate the convergence of trust region methods, an adaptive trust region is generated according to the Hessian of the iterate point. Both the nonmonotone techniques and this adaptive strategies can improve the trust region methods in the sense of convergence. We prove that the proposed method is locally superlinear convergence under some standard assumptions. Numerical results show that the new method is effective and has a high speed of convergence in practice. [ABSTRACT FROM AUTHOR]
- Published
- 2018
- Full Text
- View/download PDF
23. The continuous differential ant-stigmergy algorithm for numerical optimization.
- Author
-
Korošec, Peter and Šilc, Jurij
- Subjects
METAHEURISTIC algorithms ,SWARM intelligence ,ANT algorithms ,DISTRIBUTED artificial intelligence ,MATHEMATICAL optimization ,PHEROMONES ,PHYSIOLOGY - Abstract
Many promising optimization algorithms for solving numerical optimization problems come from population-based metaheuristics. A few of them are based on Swarm-Intelligence Algorithms, which are inspired by the collective behavior of social organisms. One of the most successful of such algorithms is the Differential Ant-Stigmergy Algorithm (DASA), which uses stigmergy, a method of communication in emergent systems where the individual parts (artificial ants) of the system communicate with one another by modifying their local environment (pheromone intensity). The main characteristic of the DASA is its underlying structure (pheromone graph) that uses discrete steps to move through a continuous search space. As a consequence of this the search-space movement is in some way limited and the algorithm’s time/space complexity is increased. In order to overcome the problem an improved algorithm called the Continuous Differential Ant-Stigmergy Algorithm (CDASA) is proposed and then benchmarked on standard benchmark functions. This benchmarking showed that the CDASA performs better than the DASA, especially at lower dimensions, that its time/space complexity is decreased, and that the algorithm code is simplified. As such, the CDASA is more suitable for parallel implementations on General-Purpose Graphic Processing Units. Compared to the Swarm-Intelligence Algorithms presented in this paper, the CDASA is the best-performing algorithm and competitive to the state-of-the-art algorithms belonging to different metaheuristic approaches. [ABSTRACT FROM AUTHOR]
- Published
- 2013
- Full Text
- View/download PDF
24. Global optimization via inverse distance weighting and radial basis functions.
- Author
-
Bemporad, Alberto
- Subjects
MATHEMATICAL optimization ,RADIAL basis functions ,GLOBAL optimization ,ALGORITHMS ,GENERATING functions ,DISTANCES - Abstract
Global optimization problems whose objective function is expensive to evaluate can be solved effectively by recursively fitting a surrogate function to function samples and minimizing an acquisition function to generate new samples. The acquisition step trades off between seeking for a new optimization vector where the surrogate is minimum (exploitation of the surrogate) and looking for regions of the feasible space that have not yet been visited and that may potentially contain better values of the objective function (exploration of the feasible space). This paper proposes a new global optimization algorithm that uses inverse distance weighting (IDW) and radial basis functions (RBF) to construct the acquisition function. Rather arbitrary constraints that are simple to evaluate can be easily taken into account. Compared to Bayesian optimization, the proposed algorithm, that we call GLIS (GLobal minimum using Inverse distance weighting and Surrogate radial basis functions), is competitive and computationally lighter, as we show in a set of benchmark global optimization and hyperparameter tuning problems. MATLAB and Python implementations of GLIS are available at http://cse.lab.imtlucca.it/~bemporad/glis. [ABSTRACT FROM AUTHOR]
- Published
- 2020
- Full Text
- View/download PDF
25. Guest editorial.
- Author
-
Bertero, Mario, Ruggiero, Valeria, and Zanni, Luca
- Subjects
CONJUGATE gradient methods ,MATHEMATICAL optimization ,ALGORITHMS - Abstract
An introduction is presented in which the editors discuss various reports within the issue on topics including the convergence properties of gradient projection methods for constrained optimization, Bregman operator splitting algorithm, and alternating direction method.
- Published
- 2013
- Full Text
- View/download PDF
26. Total variation image deblurring with space-varying kernel.
- Author
-
O'Connor, Daniel and Vandenberghe, Lieven
- Subjects
KERNEL functions ,MATHEMATICAL optimization ,NONDIFFERENTIABLE functions ,MATHEMATICAL symmetry ,FAST Fourier transforms - Abstract
Image deblurring techniques based on convex optimization formulations, such as total-variation deblurring, often use specialized first-order methods for large-scale nondifferentiable optimization. A key property exploited in these methods is spatial invariance of the blurring operator, which makes it possible to use the fast Fourier transform (FFT) when solving linear equations involving the operator. In this paper we extend this approach to two popular models for space-varying blurring operators, the Nagy-O'Leary model and the efficient filter flow model. We show how splitting methods derived from the Douglas-Rachford algorithm can be implemented with a low complexity per iteration, dominated by a small number of FFTs. [ABSTRACT FROM AUTHOR]
- Published
- 2017
- Full Text
- View/download PDF
27. Convex Euclidean distance embedding for collaborative position localization with NLOS mitigation.
- Author
-
Ding, Chao and Qi, Hou-Duo
- Subjects
EUCLIDEAN distance ,EMBEDDINGS (Mathematics) ,MEASUREMENT of distances ,MATHEMATICAL optimization ,ALGORITHMS - Abstract
One of the challenging problems in collaborative position localization arises when the distance measurements contain non-line-of-sight (NLOS) biases. Convex optimization has played a major role in modelling such problems and numerical algorithm developments. One of the successful examples is the semi-definite programming (SDP), which translates Euclidean distances into the constraints of positive semidefinite matrices, leading to a large number of constraints in the case of NLOS biases. In this paper, we propose a new convex optimization model that is built upon the concept of Euclidean distance matrix (EDM). The resulting EDM optimization has an advantage that its Lagrangian dual problem is well structured and hence is conducive to algorithm developments. We apply a recently proposed 3-block alternating direction method of multipliers to the dual problem and tested the algorithm on some real as well as simulated data of large scale. In particular, the EDM model significantly outperforms the existing SDP model and several others. [ABSTRACT FROM AUTHOR]
- Published
- 2017
- Full Text
- View/download PDF
28. The resource-constrained modulo scheduling problem: an experimental study.
- Author
-
Ayala, Maria, Benabid, Abir, Artigues, Christian, and Hanen, Claire
- Subjects
COMPUTER scheduling ,PARALLEL processing ,MATHEMATICAL optimization ,HEURISTIC programming ,MATHEMATICAL programming - Abstract
In this paper, we focus on the resource-constrained modulo scheduling problem (RCMSP), a general periodic scheduling problem, abstracted from the problem solved by compilers when optimizing inner loops at instruction level for VLIW parallel processors. Heuristic solving scheme have been proposed since many years to solve this problem, among which the decomposed software pipeling method. In this method, a cyclic scheduling problem ignoring resource constraints is first considered and a so-called legal retiming of the operations is issued. Second, a standard acyclic problem, taking this retiming as input, is solved through list scheduling techniques. In this paper, we propose a novel hybrid approach, which uses the decomposed software pipeling method to obtain a good retiming. Then the obtained retiming is used to build an integer linear programming formulation of reduced size, which allows to solve it exactly. Experimental results show that a lot more problems are solved with this new approach. The gap to the optimal solution is less than 1 % on most of the tested problem instances and the method appears to be competitive with a recently proposed constraint programming algorithm (Bonfietti et al., Lect. Notes Comput. Sci. 6876:130-144, ). [ABSTRACT FROM AUTHOR]
- Published
- 2013
- Full Text
- View/download PDF
29. Preface.
- Author
-
Birgin, Ernesto G.
- Subjects
MATHEMATICAL optimization - Abstract
The author offers an introduction to the journal in which he discusses the VII Brazilian Workshop on Continuous Optimization, a paper on a version of the Josephy-Newton method for solving generalized equations, and José Mario Martínez.
- Published
- 2010
- Full Text
- View/download PDF
30. Compression and denoising using l-norm.
- Author
-
Yau, Andy, Tai, Xuecheng, and Ng, Michael
- Subjects
IMAGE compression ,WAVELETS (Mathematics) ,IMAGE processing ,ALGORITHMS ,MATHEMATICAL optimization - Abstract
In this paper, we deal with l-norm data fitting and total variation regularization for image compression and denoising. The l-norm data fitting is used for measuring the number of non-zero wavelet coefficients to be employed to represent an image. The regularization term given by the total variation is to recover image edges. Due to intensive numerical computation of using l-norm, it is usually approximated by other functions such as the l-norm in many image processing applications. The main goal of this paper is to develop a fast and effective algorithm to solve the l-norm data fitting and total variation minimization problem. Our idea is to apply an alternating minimization technique to solve this problem, and employ a graph-cuts algorithm to solve the subproblem related to the total variation minimization. Numerical examples in image compression and denoising are given to demonstrate the effectiveness of the proposed algorithm. [ABSTRACT FROM AUTHOR]
- Published
- 2011
- Full Text
- View/download PDF
31. A global optimization method for the design of space trajectories.
- Author
-
Addis, Bernardetta, Cassioli, Andrea, Locatelli, Marco, and Schoen, Fabio
- Subjects
MATHEMATICAL optimization ,SPACE trajectories ,FLIGHT recorders ,TRAJECTORY optimization - Abstract
The problem of optimally designing a trajectory for a space mission is considered in this paper. Actual mission design is a complex, multi-disciplinary and multi-objective activity with relevant economic implications. In this paper we will consider some simplified models proposed by the European Space Agency as test problems for global optimization (GTOP database). We show that many trajectory optimization problems can be quite efficiently solved by means of relatively simple global optimization techniques relying on standard methods for local optimization. We show in this paper that our approach has been able to find trajectories which in many cases outperform those already known. We also conjecture that this problem displays a 'funnel structure' similar, in some sense, to that of molecular optimization problems. [ABSTRACT FROM AUTHOR]
- Published
- 2011
- Full Text
- View/download PDF
32. An augmented Lagrangian algorithm for multi-objective optimization.
- Author
-
Cocchi, G. and Lapucci, M.
- Subjects
MATHEMATICAL optimization ,ALGORITHMS ,LITERATURE reviews ,DEFINITIONS ,CONSTRAINED optimization ,LAGRANGIAN functions - Abstract
In this paper, we propose an adaptation of the classical augmented Lagrangian method for dealing with multi-objective optimization problems. Specifically, after a brief review of the literature, we give a suitable definition of Augmented Lagrangian for equality and inequality constrained multi-objective problems. We exploit this object in a general computational scheme that is proved to converge, under mild assumptions, to weak Pareto points of such problems. We then provide a modified version of the algorithm which is more suited for practical implementations, proving again convergence properties under reasonable hypotheses. Finally, computational experiments show that the proposed methods not only do work in practice, but are also competitive with respect to state-of-the-art methods. [ABSTRACT FROM AUTHOR]
- Published
- 2020
- Full Text
- View/download PDF
33. An improved Dai–Kou conjugate gradient algorithm for unconstrained optimization.
- Author
-
Liu, Zexian, Liu, Hongwei, and Dai, Yu-Hong
- Subjects
CENTROID ,CONJUGATE gradient methods ,MATHEMATICAL optimization ,QUASI-Newton methods ,INTEGRATED software ,INTERIOR-point methods - Abstract
It is gradually accepted that the loss of orthogonality of the gradients in a conjugate gradient algorithm may decelerate the convergence rate to some extent. The Dai–Kou conjugate gradient algorithm (SIAM J Optim 23(1):296–320, 2013), called CGOPT, has attracted many researchers' attentions due to its numerical efficiency. In this paper, we present an improved Dai–Kou conjugate gradient algorithm for unconstrained optimization, which only consists of two kinds of iterations. In the improved Dai–Kou conjugate gradient algorithm, we develop a new quasi-Newton method to improve the orthogonality by solving the subproblem in the subspace and design a modified strategy for the choice of the initial stepsize for improving the numerical performance. The global convergence of the improved Dai–Kou conjugate gradient algorithm is established without the strict assumptions in the convergence analysis of other limited memory conjugate gradient methods. Some numerical results suggest that the improved Dai–Kou conjugate gradient algorithm (CGOPT (2.0)) yields a tremendous improvement over the original Dai–Kou CG algorithm (CGOPT (1.0)) and is slightly superior to the latest limited memory conjugate gradient software package CG _ DESCENT (6.8) developed by Hager and Zhang (SIAM J Optim 23(4):2150–2168, 2013) for the CUTEr library. [ABSTRACT FROM AUTHOR]
- Published
- 2020
- Full Text
- View/download PDF
34. A generating set search method using curvature information.
- Author
-
Frimannslund, Lennart and Steihaug, Trond
- Subjects
CURVATURE ,SMOOTHING (Numerical analysis) ,ALGORITHMS ,CALCULUS ,MATHEMATICAL optimization ,STOCHASTIC convergence - Abstract
Direct search methods have been an area of active research in recent years. On many real-world problems involving computationally expensive and often noisy functions, they are one of the few applicable alternatives. However, although these methods are usually easy to implement, robust and provably convergent in many cases, they suffer from a slow rate of convergence. Usually these methods do not take the local topography of the objective function into account. We present a new algorithm for unconstrained optimisation which is a modification to a basic generating set search method. The new algorithm tries to adapt its search directions to the local topography by accumulating curvature information about the objective function as the search progresses. The curvature information is accumulated over a region thus smoothing out noise and minor discontinuities. We present some theory regarding its properties, as well as numerical results. Preliminary numerical testing shows that the new algorithm outperforms the basic method most of the time, sometimes by significant relative margins, on noisy as well as smooth problems. [ABSTRACT FROM AUTHOR]
- Published
- 2007
- Full Text
- View/download PDF
35. Iterative computation of negative curvature directions in large scale optimization.
- Author
-
Fasano, Giovanni and Roma, Massimo
- Subjects
NUMERICAL analysis ,ITERATIVE methods (Mathematics) ,MATHEMATICAL optimization ,CONJUGATE gradient methods ,LARGE scale systems ,CURVATURE - Abstract
In this paper we deal with the iterative computation of negative curvature directions of an objective function, within large scale optimization frameworks. In particular, suitable directions of negative curvature of the objective function represent an essential tool, to guarantee convergence to second order critical points. However, an "adequate" negative curvature direction is often required to have a good resemblance to an eigenvector corresponding to the smallest eigenvalue of the Hessian matrix. Thus, its computation may be a very difficult task on large scale problems. Several strategies proposed in literature compute such a direction relying on matrix factorizations, so that they may be inefficient or even impracticable in a large scale setting. On the other hand, the iterative methods proposed either need to store a large matrix, or they need to rerun the recurrence. On this guideline, in this paper we propose the use of an iterative method, based on a planar Conjugate Gradient scheme. Under mild assumptions, we provide theory for using the latter method to compute adequate negative curvature directions, within optimization frameworks. In our proposal any matrix storage is avoided, along with any additional rerun. [ABSTRACT FROM AUTHOR]
- Published
- 2007
- Full Text
- View/download PDF
36. Inexact constraint preconditioners for linear systems arising in interior point methods.
- Author
-
Bergamaschi, Luca, Gondzio, Jacek, Venturin, Manolo, and Zilli, Giovanni
- Subjects
INTERIOR-point methods ,MATHEMATICAL programming ,LINEAR systems ,MATHEMATICAL optimization ,ITERATIVE methods (Mathematics) ,JACOBIAN matrices - Abstract
Issues of indefinite preconditioning of reduced Newton systems arising in optimization with interior point methods are addressed in this paper. Constraint pre-conditioners have shown much promise in this context. However, there are situations in which an unfavorable sparsity pattern of Jacobian matrix may adversely affect the preconditioner and make its inverse representation unacceptably dense hence too expensive to be used in practice. A remedy to such situations is proposed in this paper. An approximate constraint preconditioner is considered in which sparse approximation of the Jacobian is used instead of the complete matrix. Spectral analysis of the preconditioned matrix is performed and bounds on its non-unit eigenvalues are provided. Preliminary computational results are encouraging. [ABSTRACT FROM AUTHOR]
- Published
- 2007
- Full Text
- View/download PDF
37. Optimal Production and Marketing Planning.
- Author
-
Sadjadi, Seyed J., Oroujee, Maryam, and Aryanezhad, Mir. B.
- Subjects
MARKETING ,PLANNING ,ECONOMIC lot size ,GEOMETRIC programming ,MATHEMATICAL programming ,MATHEMATICAL optimization - Abstract
This paper presents an integrated production, marketing and inventory model which determines the production lot size, marketing expenditure and product's selling price. Our model is highly nonlinear and non-convex and cannot be solved directly. Therefore, Geometric Programming (GP) is used to locate the optimal solution of the proposed model. In our GP implementation, we use a transformed dual problem in order to reduce the model to an optimization of an unconstrained problem in a single variable and the resulting problem is solved using a simple line search. We analyze the solution in different cases in order to study the behaviour of the model and for each case, a numerical example is used to demonstrate the implementation of our analysis. [ABSTRACT FROM AUTHOR]
- Published
- 2005
- Full Text
- View/download PDF
38. Conjugate Grids for Unconstrained Optimisation.
- Author
-
Byatt, D., Coope, I.D., and Price, C.J.
- Subjects
MATHEMATICAL optimization ,MATHEMATICAL functions ,ALGORITHMS ,MATHEMATICAL analysis ,OPERATIONS research ,SIMULATION methods & models - Abstract
Several recent papers have proposed the use of grids for solving unconstrained optimisation problems. Grid-based methods typically generate a sequence of grid local minimisers which converges to stationary points under mild conditions. In this paper the location and number of grid local minimisers is calculated for strictly convex quadratic functions in two dimensions with certain types of grids. These calculations show it is possible to construct a grid with an arbitrary number of grid local minimisers. The furthest of these can be an arbitrary distance from the quadratic's minimiser. These results have important implications for the design of practical grid-based algorithms. Grids based on conjugate directions do not suffer from these problems. For such grids only the grid points closest (depending on the choice of metric) to the minimiser are grid local minimisers. Furthermore, conjugate grids are shown to be reasonably stable under mild perturbations so that in practice, only approximately conjugate grids are required. [ABSTRACT FROM AUTHOR]
- Published
- 2004
- Full Text
- View/download PDF
39. An Integral Simplex Algorithm for Solving Combinatorial Optimization Problems.
- Author
-
Gerald L. Thompson
- Subjects
ALGORITHMS ,COMBINATORIAL optimization ,COMBINATORICS ,MATHEMATICAL optimization ,PARALLEL computers ,COMPUTER programming - Abstract
In this paper a local integral simplex algorithm will be described which, starting with the initial tableau of a set partitioning problem, makes pivots using the pivot on one rule until no more such pivots are possible because a local optimum has been found. If the local optimum is also a global optimum the process stops. Otherwise, a global integral simplex algorithm creates and solves the problems in a search tree consisting of a polynomial number of subproblems, subproblems of subproblems, etc. The solution to at least one of these subproblems is guaranteed to be an optimal solution to the original problem. If that solution has a bounded objective then it is an optimal set partitioning solution of the original problem, but if it has an unbounded objective then the original problem has no feasible solution. It will be shown that the total number of pivots required for the global integral simplex method to solve a set partitioning problem having m rows, where m is an arbitrary but fixed positive integer, is bounded by a polynomial function of n. A method for programming the algorithms in this paper to run on parallel computers is discussed briefly. [ABSTRACT FROM AUTHOR]
- Published
- 2002
- Full Text
- View/download PDF
40. Sufficient weighted complementarity problems.
- Author
-
Potra, Florian
- Subjects
COMPLEMENTARITY constraints (Mathematics) ,VARIATIONAL inequalities (Mathematics) ,ARTIFICIAL intelligence ,DECISION theory ,MATHEMATICAL optimization - Abstract
This paper presents some fundamental results about sufficient linear weighted complementarity problems. Such a problem depends on a nonnegative weight vector. If the weight vector is zero, the problem reduces to a sufficient linear complementarity problem that has been extensively studied. The introduction of the more general notion of a weighted complementarity problem (wCP) was motivated by the fact that wCP can model more general equilibrium problems than the classical complementarity problem (CP). The introduction of a nonzero weight vector makes the theory of wCP more complicated than the theory of CP. The paper gives a characterization of sufficient linear wCP and proposes a corrector-predictor interior-point method for its numerical solution. While the proposed algorithm does not depend on the handicap $$\kappa $$ of the problem its computational complexity is proportional with $$1+\kappa $$ . If the weight vector is zero and the starting point is relatively well centered, then the computational complexity of our algorithm is the same as the best known computational complexity for solving sufficient linear CP. [ABSTRACT FROM AUTHOR]
- Published
- 2016
- Full Text
- View/download PDF
41. Global optimization of trusses with constraints on number of different cross-sections: a mixed-integer second-order cone programming approach.
- Author
-
Kanno, Yoshihiro
- Subjects
CONES ,GLOBAL optimization ,MATHEMATICAL optimization ,EXPERIMENTS ,RESEARCH - Abstract
In design practice it is often that the structural components are selected from among easily available discrete candidates and a number of different candidates used in a structure is restricted to be small. Presented in this paper is a new modeling of the design constraints for obtaining the minimum compliance truss design in which only a limited number of different cross-section sizes are employed. The member cross-sectional areas are considered either discrete design variables that can take only predetermined values or continuous design variables. In both cases it is shown that the compliance minimization problem can be formulated as a mixed-integer second-order cone programming problem. The global optimal solution of this optimization problem is then computed by using an existing solver based on a branch-and-cut algorithm. Numerical experiments are performed to show that the proposed approach is applicable to moderately large-scale problems. [ABSTRACT FROM AUTHOR]
- Published
- 2016
- Full Text
- View/download PDF
42. A simple convergence analysis of Bregman proximal gradient algorithm.
- Author
-
Zhou, Yi, Liang, Yingbin, and Shen, Lixin
- Subjects
CONVEX functions ,ALGORITHMS ,ITERATIVE methods (Mathematics) ,MATHEMATICAL optimization - Abstract
In this paper, we provide a simple convergence analysis of proximal gradient algorithm with Bregman distance, which provides a tighter bound than existing result. In particular, for the problem of minimizing a class of convex objective functions, we show that proximal gradient algorithm with Bregman distance can be viewed as proximal point algorithm that incorporates another Bregman distance. Consequently, the convergence result of the proximal gradient algorithm with Bregman distance follows directly from that of the proximal point algorithm with Bregman distance, and this leads to a simpler convergence analysis with a tighter convergence bound than existing ones. We further propose and analyze the backtracking line-search variant of the proximal gradient algorithm with Bregman distance. [ABSTRACT FROM AUTHOR]
- Published
- 2019
- Full Text
- View/download PDF
43. An iterative method for solving a bi-objective constrained portfolio optimization problem.
- Author
-
Bezoui, Madani, Moulaï, Mustapha, Bounceur, Ahcène, and Euler, Reinhardt
- Subjects
INVESTMENT management ,QUADRATIC programming ,MATHEMATICAL optimization ,ANALYSIS of variance ,METAHEURISTIC algorithms - Abstract
In this work, we consider the problem of portfolio optimization under cardinality and quantity constraints. We use the standard model of mean-variance in its bi-objective form which is presented here as a bi-objective quadratic programming problem under cardinality and quantity constraints. This problem is NP-hard, which is why the majority of methods proposed in the literature use metaheuristics for its resolution. In this paper, we propose an iterative method for solving constrained portfolio optimization problems. Experiments are performed with major market indices, such as the Hang Seng, DAX, FTSE, S&P 100, Nikkei, S&P 500 and Nasdaq using real-world datasets involving up to 2196 assets. Comparisons with two exact methods and a metaheuristic are performed. These results show that the new method allows to find efficient portfolio fronts in reasonable time. [ABSTRACT FROM AUTHOR]
- Published
- 2019
- Full Text
- View/download PDF
44. Cholesky QR-based retraction on the generalized Stiefel manifold.
- Author
-
Sato, Hiroyuki and Aihara, Kensuke
- Subjects
FACTORIZATION ,STIEFEL manifolds ,RIEMANNIAN manifolds ,TOPOLOGICAL spaces ,MATHEMATICAL optimization - Abstract
When optimizing on a Riemannian manifold, it is important to use an efficient retraction, which maps a point on a tangent space to a point on the manifold. In this paper, we prove a map based on the QR factorization to be a retraction on the generalized Stiefel manifold. In addition, we propose an efficient implementation of the retraction based on the Cholesky QR factorization. Numerical experiments show that the proposed retraction is more efficient than the existing one based on the polar factorization. [ABSTRACT FROM AUTHOR]
- Published
- 2019
- Full Text
- View/download PDF
45. On the optimal solution set in interval linear programming.
- Author
-
Garajová, Elif and Hladík, Milan
- Subjects
LINEAR programming ,MATHEMATICAL optimization ,COEFFICIENTS (Statistics) ,DECOMPOSITION method ,CONVEX domains ,EXPERIMENTS - Abstract
Determining the set of all optimal solutions of a linear program with interval data is one of the most challenging problems discussed in interval optimization. In this paper, we study the topological and geometric properties of the optimal set and examine sufficient conditions for its closedness, boundedness, connectedness and convexity. We also prove that testing boundedness is co-NP-hard for inequality-constrained problems with free variables. Furthermore, we prove that computing the exact interval hull of the optimal set is NP-hard for linear programs with an interval right-hand-side vector. We then propose a new decomposition method for approximating the optimal solution set based on complementary slackness and show that the method provides the exact description of the optimal set for problems with a fixed coefficient matrix. Finally, we conduct computational experiments to compare our method with the existing orthant decomposition method. [ABSTRACT FROM AUTHOR]
- Published
- 2019
- Full Text
- View/download PDF
46. Unifying semidefinite and set-copositive relaxations of binary problems and randomization techniques.
- Author
-
Lieder, Felix, Rad, Fatemeh, and Jarre, Florian
- Subjects
SEMIDEFINITE programming ,BINARY number system ,MATHEMATICAL optimization ,NUMERICAL analysis ,RELAXATION methods (Mathematics) - Abstract
A reformulation of quadratically constrained binary programs as duals of set-copositive linear optimization problems is derived using either $$\{0,1\}$$ -formulations or $$\{-1,1\}$$ -formulations. The latter representation allows an extension of the randomization technique by Goemans and Williamson. An application to the max-clique problem shows that the max-clique problem is equivalent to a linear program over the max-cut polytope with one additional linear constraint. This transformation allows the solution of a semidefinite relaxation of the max-clique problem with about the same computational effort as the semidefinite relaxation of the max-cut problem-independent of the number of edges in the underlying graph. A numerical comparison of this approach to the standard Lovasz number concludes the paper. [ABSTRACT FROM AUTHOR]
- Published
- 2015
- Full Text
- View/download PDF
47. Using an outward selective pressure for improving the search quality of the MOEA/D algorithm.
- Author
-
Michalak, Krzysztof
- Subjects
MATHEMATICAL optimization ,MATHEMATICAL programming ,PARETO analysis ,EVOLUTIONARY algorithms ,COMPUTATIONAL complexity - Abstract
In optimization problems it is often necessary to perform an optimization based on more than one objective. The goal of the multiobjective optimization is usually to find an approximation of the Pareto front which contains solutions that represent the best possible trade-offs between the objectives. In a multiobjective scenario it is important to both improve the solutions in terms of the objectives and to find a wide variety of available options. Evolutionary algorithms are often used for multiobjective optimization because they maintain a population of individuals which directly represent a set of solutions of the optimization problem. multiobjective evolutionary algorithm based on decomposition (MOEA/D) is one of the most effective multiobjective algorithms currently used in the literature. This paper investigates several methods which increase the selective pressure to the outside of the Pareto front in the case of the MOEA/D algorithm. Experiments show that by applying greater selective pressure in the outwards direction the quality of results obtained by the algorithm can be increased. The proposed methods were tested on nine test instances with complicated Pareto sets. In the tests the new methods outperformed the original MOEA/D algorithm. [ABSTRACT FROM AUTHOR]
- Published
- 2015
- Full Text
- View/download PDF
48. A derivative-free descent method in set optimization.
- Author
-
Jahn, Johannes
- Subjects
MATHEMATICAL optimization ,CONVEX sets ,SET theory ,CONVEX programming ,LINEAR algebra - Abstract
Based on a vectorization result in set optimization with respect to the set less order relation, this paper shows how to relate two nonempty sets on a computer. This result is developed for generalized convex sets and polyhedral sets in finite dimensional spaces. Using this approach a numerical method for the determination of optimal scenarios is presented. A new derivative-free descent method for the solution of set optimization problems is given together with numerical results in low dimensions. [ABSTRACT FROM AUTHOR]
- Published
- 2015
- Full Text
- View/download PDF
49. Limited memory BFGS method based on a high-order tensor model.
- Author
-
Biglari, Fahimeh and Ebadian, Ali
- Subjects
QUASI-Newton methods ,ITERATIVE methods (Mathematics) ,MATHEMATICAL optimization ,NONLINEAR programming ,SECANT function ,STOCHASTIC convergence - Abstract
This paper is aimed to employ a modified quasi-Newton equation in the framework of the limited memory BFGS method to solve large-scale unconstrained optimization problems. The modified secant equation is derived by means of a forth order tensor model to improve the curvature information of the objective function. The global and local convergence properties of the modified LBFGS method, on uniformly convex problems are also studied. The numerical results indicate that the proposed limited memory method is superior to the standard LBFGS method. [ABSTRACT FROM AUTHOR]
- Published
- 2015
- Full Text
- View/download PDF
50. Semi-definite programming relaxation of quadratic assignment problems based on nonredundant matrix splitting.
- Author
-
Peng, Jiming, Zhu, Tao, Luo, Hezhi, and Toh, Kim-Chuan
- Subjects
SEMIDEFINITE programming ,QUADRATIC assignment problem ,QUADRATIC programming ,MATHEMATICAL optimization ,SYMMETRIC matrices - Abstract
Quadratic assignment problems (QAPs) are known to be among the most challenging discrete optimization problems. Recently, a new class of semi-definite relaxation models for QAPs based on matrix splitting has been proposed (Mittelmann and Peng, SIAM J Optim 20:3408-3426, ; Peng et al., Math Program Comput 2:59-77, ). In this paper, we consider the issue of how to choose an appropriate matrix splitting scheme so that the resulting relaxation model is easy to solve and able to provide a strong bound. For this, we first introduce a new notion of the so-called redundant and non-redundant matrix splitting and show that the relaxation based on a non-redundant matrix splitting can provide a stronger bound than a redundant one. Then we propose to follow the minimal trace principle to find a non-redundant matrix splitting via solving an auxiliary semi-definite programming problem. We show that applying the minimal trace principle directly leads to the so-called orthogonal matrix splitting introduced in (Peng et al., Math Program Comput 2:59-77, ). To find other non-redundant matrix splitting schemes whose resulting relaxation models are relatively easy to solve, we elaborate on two splitting schemes based on the so-called one-matrix and the sum-matrix. We analyze the solutions from the auxiliary problems for these two cases and characterize when they can provide a non-redundant matrix splitting. The lower bounds from these two splitting schemes are compared theoretically. Promising numerical results on some large QAP instances are reported, which further validate our theoretical conclusions. [ABSTRACT FROM AUTHOR]
- Published
- 2015
- Full Text
- View/download PDF
Discovery Service for Jio Institute Digital Library
For full access to our library's resources, please sign in.