scholarly journals Solving the unconstrained optimization problem by a variable neighborhood search

2007 ◽  
Vol 328 (2) ◽  
pp. 1178-1187 ◽  
Author(s):  
M. Duran Toksarı ◽  
Ertan Güner
Keyword(s):  
Unconstrained Optimization ◽  
Optimization Problem ◽  
Variable Neighborhood Search ◽  
Neighborhood Search ◽  
Unconstrained Optimization Problem

scholarly journals GENO – Optimization for Classical Machine Learning Made Fast and Easy

2020 ◽  
Vol 34 (09) ◽  
pp. 13620-13621
Author(s):  
Sören Laue ◽  
Matthias Mitterreiter ◽  
Joachim Giesen
Keyword(s):  
Machine Learning ◽  
Unconstrained Optimization ◽  
Optimization Problem ◽  
Specific Problem ◽  
Optimization Problems ◽  
Modeling Language ◽  
Large Margin ◽  
Unconstrained Optimization Problem

Most problems from classical machine learning can be cast as an optimization problem. We introduce GENO (GENeric Optimization), a framework that lets the user specify a constrained or unconstrained optimization problem in an easy-to-read modeling language. GENO then generates a solver, i.e., Python code, that can solve this class of optimization problems. The generated solver is usually as fast as hand-written, problem-specific, and well-engineered solvers. Often the solvers generated by GENO are faster by a large margin compared to recently developed solvers that are tailored to a specific problem class.An online interface to our framework can be found at http://www.geno-project.org.

GENERALIZATION OF BAYESIAN RULE OF MANY SIMPLE HYPOTHESES TESTING

2003 ◽  
Vol 02 (01) ◽  
pp. 41-70 ◽  
Author(s):  
K. J. KACHIASHVILI
Keyword(s):  
Unconstrained Optimization ◽  
Bayesian Approach ◽  
Optimization Problem ◽  
Classical Case ◽  
Hypotheses Testing ◽  
Unconstrained Optimization Problem ◽  
Finite Set ◽  
Statistical Hypotheses ◽  
Space Point ◽  
Statistical Hypotheses Testing

There are different methods of statistical hypotheses testing.1–4 Among them, is Bayesian approach. A generalization of Bayesian rule of many hypotheses testing is given below. It consists of decision rule dimensionality with respect to the number of tested hypotheses, which allows to make decisions more differentiated than in the classical case and to state, instead of unconstrained optimization problem, constrained one that enables to make guaranteed decisions concerning errors of true decisions rejection, which is the key point when solving a number of practical problems. These generalizations are given both for a set of simple hypotheses, each containing one space point, and hypotheses containing a finite set of separated space points.

scholarly journals Symmetric and Positive Definite Broyden Update for Unconstrained Optimization

2019 ◽  
Vol 16 (3) ◽  
pp. 0661
Author(s):  
Mahmood Et al.
Keyword(s):  
Unconstrained Optimization ◽  
Optimization Problem ◽  
Hessian Matrix ◽  
Positive Definite ◽  
Broyden Method ◽  
Unconstrained Optimization Problem ◽  
Broyden Update ◽  
The Difference ◽  
The One ◽  
Symmetric Property

Broyden update is one of the one-rank updates which solves the unconstrained optimization problem but this update does not guarantee the positive definite and the symmetric property of Hessian matrix. In this paper the guarantee of positive definite and symmetric property for the Hessian matrix will be established by updating the vector  which represents the difference between the next gradient and the current gradient of the objective function assumed to be twice continuous and differentiable .Numerical results are reported to compare the proposed method with the Broyden method under standard problems.

scholarly journals An n-th section line search in conjugate gradient method for small-scale unconstrained optimization

2017 ◽  
Vol 13 (4) ◽  
pp. 588-592
Author(s):  
Muhammad Imza Fakhri ◽  
Mohd Rivaie Mohd Ali ◽  
Ibrahim Jusoh
Keyword(s):  
Unconstrained Optimization ◽  
Conjugate Gradient ◽  
Line Search ◽  
Optimization Problem ◽  
Small Scale ◽  
Bisection Method ◽  
Inexact Line Search ◽  
Unconstrained Optimization Problem ◽  
Ideal Method ◽  
Bisection Line

Conjugate Gradient (CG) methods are well-known method for solving unconstrained optimization problem and popular for its low memory requirement. A lot of researches and efforts have been done in order to improve the efficiency of this CG method. In this paper, a new inexact line search is proposed based on Bisection line search. Initially, Bisection method is the easiest method to solve root of a function. Thus, it is an ideal method to employ in CG method. This new modification is named n-th section. In a nutshell, this proposed method is promising and more efficient compared to the original Bisection line search. 

Sign in / Sign up

Export Citation Format

Share Document