A DC programming approach for feature selection in support vector machines learning
, 2008 Feature selection, SVM, Nonconvex optimisation, DC programming, DCA, 90C26, 62-07,
Nguyen, van Vinh +7 more
core +1 more source
A new optimization method based on Perry's idea through the use of the matrix power [PDF]
, 2021 MSC 2010: 90C30, 90C26, 90C06The purpose of this paper is to present a new conjugate gradient method for solving unconstrained nonlinear optimization problems, based on Perry’s idea.
Imane Hafaidia, Noureddine Benrabia, Mourad Ghiat, Hamza Guebbai
core
Sensitivity analysis of a continuous multifacility competitive location and design problem
, 2009 Continuous location, Facility design, Competition, Multifacility, Sensitivity analysis, Evolutionary algorithm, Computational study, 90B85, 90C31, 90C26, 68T20,
P. Ortigosa +5 more
core +1 more source
DrAmpl: a meta solver for optimization problem analysis
, 2009 Optimization model, AMPL modeling language, Directed acyclic graph, Convexity assessment, Structural model analysis, Solver recommendation, C61, C63, 90C25, 90C26, 90C30,
Dominique Orban +3 more
core +1 more source
A new hybrid conjugate gradient algorithm based on the Newton direction to solve unconstrained optimization problems [PDF]
, 2023 https://doi.org/10.1007/s12190-022-01821-zIn this paper, we propose a new hybrid conjugate gradient method to solve unconstrained optimization problems. This new method is defined as a convex combination of DY and DL conjugate gradient methods.
Naima Hamel, Noureddine Benrabia, Mourad Ghiat, Hamza Guebbai
core
Performance Bounds For Co-/Sparse Box Constrained Signal Recovery
Analele Stiintifice ale Universitatii Ovidius Constanta: Seria Matematica, 2019 The recovery of structured signals from a few linear measurements is a central point in both compressed sensing (CS) and discrete tomography. In CS the signal structure is described by means of a low complexity model e.g. co-/sparsity.
Kuske Jan, Petra Stefania
doaj +1 more source
A new augmented Lagrangian approach to duality and exact penalization
Augmented Lagrangian, Augmenting function, Nonconvex problem, Duality, 90C26, 90C46,
C. Lalitha
core +1 more source
Piece adding technique for convex maximization problems
Global search algorithm, Local search algorithm, Nonconvex optimization, Convex maximization, Piecewise convex maximization, 90C26, 90C47, 49M05, 49M30,
Ider Tseveendorj, Dominique Fortin
core +1 more source
Generalized derivatives and nonsmooth optimization, a finite dimensional tour
, 2005 Convex optimization, nonsmooth analysis, nonsmooth optimization, set-valued maps, variational analysis, mathematical programming, nonconvex programming, nonlinear programming, optimality conditions, second order conditions, tangent cones, normal cones ...
Joydeep Dutta
core +1 more source
P-algorithm based on a simplicial statistical model of multimodal functions
Statistical models of multimodal functions, Global optimization, Simplicial partition, 90C26,
Antanas Žilinskas, Julius Žilinskas
core +1 more source