A derivative-free optimization method for solving classification problem

QR Code

A derivative-free optimization method for solving classification problem

Problem statement: The aim of data classification is to establish rules for the classification of some observations assuming that we have a database, which includes of at least two classes. There is a training set for each class. Those problems occur in a wide range of human activity. One of the mos...

Full description

Bibliographic Details
Main Authors:	Shabanzadeh, Parvaneh, Abu Hassan, Malik, Leong, Wah June
Format:	Article
Language:	English
Published:	Science Publications 2010
Online Access:	http://psasir.upm.edu.my/id/eprint/12683/ http://psasir.upm.edu.my/id/eprint/12683/1/12683.pdf

Similar Items

Application of Optimization Methods for Solving Clustering and Classification Problems
by: Shabanzadeh, Parvaneh
Published: (2011)

A nonsmooth optimization method for clustering problem
by: Shabanzadeh, Parvaneh, et al.
Published: (2009)

Using Pattern Search Methods for Minimizing Clustering Problems
by: Shabanzadeh, Parvaneh, et al.
Published: (2010)

A matrix-free quasi-Newton method for solving large-scale nonlinear systems.
by: Leong, Wah June, et al.
Published: (2011)

Jacobian-free diagonal Newton's method for solving nonlinear systems with singular Jacobian
by: Yusuf, Mohammed Waziri, et al.
Published: (2011)

The hybrid BFGS-CG method in solving unconstrained optimization problems
by: Ibrahim, Mohd Asrul Hery, et al.
Published: (2014)

Scaled memoryless symmetric rank one method for large-scale optimization.
by: Leong, Wah June, et al.
Published: (2011)

Scaled memoryless symmetric rank one method for large-scale unconstrained optimization
by: Leong, Wah June, et al.
Published: (2008)

A new inexact line search method for convex optimization problems
by: Moyi, Aliyu Usman, et al.
Published: (2013)

Positive-definite memoryless symmetric rank one method for large-scale unconstrained optimization
by: Leong, Wah June, et al.
Published: (2011)

Scaled memoryless BFGS preconditioned steepest descent method for very large-scale unconstrained optimization
by: Leong, Wah June, et al.
Published: (2009)

Structured symmetric rank-one method for unconstrained optimization
by: Modarres, Farzin, et al.
Published: (2011)

Jacobian computation-free Newton's method for systems of nonlinear equations.
by: Yusuf, Mohammed Waziri, et al.
Published: (2010)

A monotone gradient method via weak secant equation for unconstrained optimization
by: Leong, Wah June, et al.
Published: (2010)

A new two-step gradient-type method for large-scale unconstrained optimization
by: Farid, Mahboubeh, et al.
Published: (2010)

A symmetric rank-one method based on extra updating techniques for unconstrained optimization.
by: Modarres, Farzin, et al.
Published: (2011)

A computational method for solving time-delay optimal control problems with free terminal time
by: Liu, C., et al.
Published: (2014)

Improved stochastic gradient descent algorithm with mean-gradient adaptive stepsize for solving large-scale optimization problems
by: Zulkifli, Munierah, et al.
Published: (2023)

Two-step derivative-free diagonally Newton's method for large-scale nonlinear equations
by: Yusuf, Mohammed Waziri, et al.
Published: (2013)

Memoryless modified symmetric rank-one method for large-scale unconstrained optimization
by: Modarres, Farzin, et al.
Published: (2009)

A restarting approach on symmetric rank one update for unconstrained optimization
by: Leong, Wah June, et al.
Published: (2009)

The CG-BFGS method for unconstrained optimization problems
by: Ibrahim, Mohd Asrul Hery, et al.
Published: (2013)

A new gradient method via least change secant update
by: Leong, Wah June, et al.
Published: (2011)

Convergence of a positive definite symmetric rank one method with restart
by: Leong, Wah June, et al.
Published: (2009)

A family of least change diagonally quasi-Newton methods for nonlinear equations
by: Leong, Wah June, et al.
Published: (2010)

Modified Quasi-Newton Methods For Large-Scale Unconstrained Optimization
by: Leong, Wah June
Published: (2003)

On methods for solving nonlinear semidefinite optimization problems
by: Sun, Jie
Published: (2011)

Memoryless symmetric rank-one method based on modified secant equation for large-scale unconstrained optimization
by: Khiyabani, Farzin Modarres, et al.
Published: (2009)

Preconditioned subspace quasi-newton method for large scale optimization
by: Sim, Hong Seng, et al.
Published: (2014)

Some diagonal preconditioners for limited memory quasi-Newton method for large Scale optimization
by: Sim, Hong Seng, et al.
Published: (2013)

A remark on the uniqueness of solutions for a perturbed system using the Zubov method
by: Abedi, Fakhreddin, et al.
Published: (2009)

A new modified conjugate gradient method under the strong Wolfe line search for solving unconstrained optimization problems
by: Ishak, M. I., et al.
Published: (2022)

Multi-steps symmetric rank-one update for unconstrained optimization
by: Modarres, Farzin, et al.
Published: (2009)

Efficient ODE-based methods for unconstrained optimization
by: Yap, Chui Ying, et al.
Published: (2018)

Improved Hessian approximation with modified quasi-Cauchy relation for a gradient-type method
by: Leong, Wah June, et al.
Published: (2010)

Solving the boundary problems for biharmonic operator by using the conformable fractional derivative method
by: Ahmedov, Anvarjon A., et al.
Published: (2018)

A new gradient method via quasi-Cauchy relation which guarantees descent
by: Abu Hassan, Malik, et al.
Published: (2009)

Computational methods for solving optimal industrial process control problems
by: Chai, Qinqin
Published: (2013)

A new optimized Runge-Kutta method for solving oscillatory problems
by: Hussain, Kasim, et al.
Published: (2016)

A hybrid optimization method in solving nurse duty roster problem
by: Ng, Jian Qin
Published: (2017)