A nonsmooth optimization method for clustering problem

QR Code

A nonsmooth optimization method for clustering problem

Bibliographic Details
Main Authors:	Shabanzadeh, Parvaneh, Abu Hasan, Malik, Leong, Wah June
Format:	Conference or Workshop Item
Language:	English
Published:	Faculty of Science, Universiti Putra Malaysia 2009
Online Access:	http://psasir.upm.edu.my/id/eprint/65925/ http://psasir.upm.edu.my/id/eprint/65925/1/A%20nonsmooth%20optimization%20method%20for%20clustering%20problem.pdf

Similar Items

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

A derivative-free optimization method for solving classification problem
by: Shabanzadeh, Parvaneh, et al.
Published: (2010)

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

Clusters in nonsmooth oscillator networks
by: Nicks, Rachel, et al.
Published: (2018)

Gradient-free method for nonsmooth distributed optimization
by: Li, J., et al.
Published: (2015)

Numerical method for a class of optimal control problems subject to nonsmooth functional constraints
by: Wu, C., et al.
Published: (2008)

Incremental gradient-free method for nonsmooth distributed optimization
by: Li, J., et al.
Published: (2017)

A quasisecant method for solving a system of nonsmooth equations
by: Long, Q., et al.
Published: (2013)

A nonsmooth equation system solver based on subgradient method
by: Long, Q., et al.
Published: (2017)

Variable metric proximal stochastic variance reduced gradient methods for nonconvex nonsmooth optimization
by: Yu, T., et al.
Published: (2022)

Nonsmooth algorithms and Nesterov’s smoothing technique for generalized Fermat–Torricelli problems
by: Nam, N.M., et al.
Published: (2014)

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

Nonsmooth dynamics in spiking neuron models
by: Coombes, Stephen, et al.
Published: (2012)

Characterizations of Nonsmooth Robustly Quasiconvex Functions
by: Bui, Hoa, et al.
Published: (2019)

A system of nonsmooth equations solver based upon subgradient method
by: Long, Q., et al.
Published: (2015)

Nonsmooth optimization over the (weakly or properly) Pareto set of a linear-quadratic multi-objective control problem: Explicit optimality conditions
by: Bonnel, Henri, et al.
Published: (2011)

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)

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)

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

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

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

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

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)

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

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)

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

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

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

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

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

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

An improved multi-step gradient-type method for large scale optimization
by: Farid, Mahboubeh, et al.
Published: (2011)

Convergence and stability of line search methods for unconstrained optimization.
by: Leong, Wah June, et al.
Published: (2013)

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

A scaled three-term conjugate gradient method for unconstrained optimization
by: Arzuka, Ibrahim, et al.
Published: (2016)

A three-term conjugate gradient method with nonmonotone line search for unconstrained optimization
by: Moyi, Aliyu Usman, et al.
Published: (2016)