Numerical experiments with partially separable optimization problems

1984 ◽  
pp. 203-220 ◽  
Author(s):  
A. Griewank ◽  
Ph. L. Toint
Keyword(s):  
Numerical Experiments ◽  
Optimization Problems ◽  
Separable Optimization

A Non-Monotone Line Search Combination Technique for Unconstrained Optimization

2014 ◽  
Vol 8 (1) ◽  
pp. 218-221 ◽  
Author(s):  
Ping Hu ◽  
Zong-yao Wang
Keyword(s):  
Global Convergence ◽  
Unconstrained Optimization ◽  
Numerical Experiments ◽  
Line Search ◽  
Optimization Problems ◽  
Search Algorithm ◽  
New Combination ◽  
Combination Rule ◽  
Combination Technique ◽  
Unconstrained Optimization Problems

We propose a non-monotone line search combination rule for unconstrained optimization problems, the corresponding non-monotone search algorithm is established and its global convergence can be proved. Finally, we use some numerical experiments to illustrate the new combination of non-monotone search algorithm’s effectiveness.

scholarly journals Investigation of Improved Cooperative Coevolution for Large-Scale Global Optimization Problems

Algorithms ◽  
2021 ◽  
Vol 14 (5) ◽  
pp. 146
Author(s):  
Aleksei Vakhnin ◽  
Evgenii Sopov
Keyword(s):  
Global Optimization ◽  
Evolutionary Algorithms ◽  
Numerical Experiments ◽  
Large Scale ◽  
Optimization Problems ◽  
State Of The Art ◽  
Fixed Number ◽  
High Dimensional ◽  
Cooperative Coevolution ◽  
Large Scale Problems

Modern real-valued optimization problems are complex and high-dimensional, and they are known as “large-scale global optimization (LSGO)” problems. Classic evolutionary algorithms (EAs) perform poorly on this class of problems because of the curse of dimensionality. Cooperative Coevolution (CC) is a high-performed framework for performing the decomposition of large-scale problems into smaller and easier subproblems by grouping objective variables. The efficiency of CC strongly depends on the size of groups and the grouping approach. In this study, an improved CC (iCC) approach for solving LSGO problems has been proposed and investigated. iCC changes the number of variables in subcomponents dynamically during the optimization process. The SHADE algorithm is used as a subcomponent optimizer. We have investigated the performance of iCC-SHADE and CC-SHADE on fifteen problems from the LSGO CEC’13 benchmark set provided by the IEEE Congress of Evolutionary Computation. The results of numerical experiments have shown that iCC-SHADE outperforms, on average, CC-SHADE with a fixed number of subcomponents. Also, we have compared iCC-SHADE with some state-of-the-art LSGO metaheuristics. The experimental results have shown that the proposed algorithm is competitive with other efficient metaheuristics.

scholarly journals An Augmented Lagrangian Method for Cardinality-Constrained Optimization Problems

2021 ◽  
Author(s):  
Christian Kanzow ◽  
Andreas B. Raharja ◽  
Alexandra Schwartz
Keyword(s):  
Constrained Optimization ◽  
Numerical Experiments ◽  
Penalty Method ◽  
Augmented Lagrangian ◽  
Constraint Qualification ◽  
Optimization Problems ◽  
Augmented Lagrangian Method ◽  
Constrained Optimization Problems ◽  
Strongly Stationary ◽  
Type Constraint

AbstractA reformulation of cardinality-constrained optimization problems into continuous nonlinear optimization problems with an orthogonality-type constraint has gained some popularity during the last few years. Due to the special structure of the constraints, the reformulation violates many standard assumptions and therefore is often solved using specialized algorithms. In contrast to this, we investigate the viability of using a standard safeguarded multiplier penalty method without any problem-tailored modifications to solve the reformulated problem. We prove global convergence towards an (essentially strongly) stationary point under a suitable problem-tailored quasinormality constraint qualification. Numerical experiments illustrating the performance of the method in comparison to regularization-based approaches are provided.

scholarly journals A randomized adaptive trust region line search method

2020 ◽  
Vol 10 (2) ◽  
pp. 259-263
Author(s):  
Saman Babaie-Kafaki ◽  
Saeed Rezaee
Keyword(s):  
Simulated Annealing ◽  
Numerical Experiments ◽  
Line Search ◽  
Optimization Problems ◽  
Trust Region ◽  
Search Method ◽  
Test Problems ◽  
Unconstrained Optimization Problems ◽  
Line Search Method ◽  
Region Line

Hybridizing the trust region, line search and simulated annealing methods, we develop a heuristic algorithm for solving unconstrained optimization problems. We make some numerical experiments on a set of CUTEr test problems to investigate efficiency of the suggested algorithm. The results show that the algorithm is practically promising.

scholarly journals Second-Order Cone Programming Formulations for Robust Multiclass Classification

2007 ◽  
Vol 19 (1) ◽  
pp. 258-282 ◽  
Author(s):  
Ping Zhong ◽  
Masao Fukushima
Keyword(s):  
Numerical Experiments ◽  
Optimization Problems ◽  
Multiclass Classification ◽  
Training Data ◽  
Support Vector ◽  
Research Subject ◽  
Ongoing Research ◽  
Second Order Cone ◽  
Linear And Nonlinear ◽  
Nonlinear Robust

Multiclass classification is an important and ongoing research subject in machine learning. Current support vector methods for multiclass classification implicitly assume that the parameters in the optimization problems are known exactly. However, in practice, the parameters have perturbations since they are estimated from the training data, which are usually subject to measurement noise. In this article, we propose linear and nonlinear robust formulations for multiclass classification based on the M-SVM method. The preliminary numerical experiments confirm the robustness of the proposed method.

The Application of Fuzzification for Solving Quadratic Functions

2021 ◽  
Author(s):  
Lunshan Gao
Keyword(s):  
Approximate Solution ◽  
Approximation Algorithm ◽  
Critical Point ◽  
Numerical Experiments ◽  
Optimization Problems ◽  
Local Minimizer ◽  
Quadratic Functions ◽  
Computational Time ◽  
Computational Results ◽  
Average Computational Time

Abstract This paper describes an approximation algorithm for solving standard quadratic optimization problems(StQPs) over the standard simplex by using fuzzification technique. We show that the approximate solution of the algorithm is an epsilon -critical point and satisfies epsilon-delta condition. The algorithm is compared with IBM ILOG CPLEX (short for CPLEX). The computational results indicate that the new algorithm is faster than CPLEX. Especially for infeasible problems. Furthermore, we calculate 100 instances for different size StQP problems. The numerical experiments show that the average computational time of the new algorithm for calculating the first local minimizer is in BigO(n) when the size of the problems is less or equal to 450.

A Bayesian Approach to Simulated Annealing

1989 ◽  
Vol 3 (4) ◽  
pp. 453-475 ◽  
Author(s):  
P.J.M. Van Laarhoven ◽  
C.G.E. Boender ◽  
E.H.L. Aarts ◽  
A. H. G. Rinnooy Kan
Keyword(s):  
Markov Chain ◽  
Simulated Annealing ◽  
Probability Distribution ◽  
Posterior Distribution ◽  
Prior Distribution ◽  
Numerical Experiments ◽  
Optimization Problems ◽  
Probabilistic Algorithm ◽  
Unknown Parameters ◽  
Combinatorial Optimization Problems

Simulated annealing is a probabilistic algorithm for approximately solving large combinatorial optimization problems. The algorithm can mathematically be described as the generation of a series of Markov chains, in which each Markov chain can be viewed as the outcome of a random experiment with unknown parameters (the probability of sampling a cost function value). Assuming a probability distribution on the values of the unknown parameters (the prior distribution) and given the sequence of configurations resulting from the generation of a Markov chain, we use Bayes's theorem to derive the posterior distribution on the values of the parameters. Numerical experiments are described which show that the posterior distribution can be used to predict accurately the behavior of the algorithm corresponding to the next Markov chain. This information is also used to derive optimal rules for choosing some of the parameters governing the convergence of the algorithm.

Element-by-Element Preconditioners for Large Partially Separable Optimization Problems

1997 ◽  
Vol 18 (6) ◽  
pp. 1767-1787 ◽  
Author(s):  
Michel J. Daydé ◽  
Jean-Yves L'Excellent ◽  
Nicholas I. M. Gould
Keyword(s):  
Optimization Problems ◽  
Separable Optimization
Sign in / Sign up

Export Citation Format

Share Document