Fast projected gradient method for support vector machines

V Bloom, I Griva, F Quijada - Optimization and Engineering, 2016 - Springer
We present an algorithm for training dual soft margin support vector machines (SVMs) based
on an augmented Lagrangian (AL) that uses a modification of the fast projected gradient …

Exterior-point method for support vector machines

V Bloom, I Griva, B Kwon… - IEEE Transactions on …, 2013 - ieeexplore.ieee.org
We present an exterior-point method (EPM) for training dual-soft margin support vector
machines (SVMs). The EPM stems from nonlinear rescaling and augmented Lagrangian …

[PDF][PDF] 电力系统内-外点优化潮流算法

赵洪山, 陈博 - 电工技术学报, 2010 - dgjsxb.ces-transaction.com
摘要提出了利用内-外点算法(IEPM) 求解电力系统最优潮流问题. 内点法(IPM)
具有全局收敛性好的优点, 但有时在最优点附近其收敛速度会降低, 而外点法(EPM) …

Efficient Training of One Class Classification-SVMs

IA Yowetu, NK Frempong - arXiv preprint arXiv:2309.16745, 2023 - arxiv.org
This study examines the use of a highly effective training method to conduct one-class
classification. The existence of both positive and negative examples in the training data is …

[PDF][PDF] Augmented Lagrangian—Fast Projected Gradient Algorithm with Working Set Selection for Training Support Vector Machines

M Aregbesola, I Griva - Journal of Applied and Numerical …, 2021 - jano.biemdas.com
We present an algorithm for training Support Vector Machines (SVM) for classification based
on fast projected gradient, augmented Lagrangian methods and a working set selection …

[PDF][PDF] Métodos híbridos de pontos interiores/exteriores e de aproximantes de funções em problemas multiobjetivo de despacho econômico e ambiental

E Gonçalves - 2015 - repositorio.unesp.br
O problema multiobjetivo de despacho econômico e ambiental é formulado envolvendo a
minimização de dois objetivos conflitantes: custo da geração termoelétrica de energia e a …

An exterior point polynomial-time algorithm for convex quadratic programming

DG Tian - Computational Optimization and Applications, 2015 - Springer
In this paper an exterior point polynomial time algorithm for convex quadratic programming
problems is proposed. We convert a convex quadratic program into an unconstrained …

A nonlinear Lagrange algorithm for minimax problems with general constraints

S He, X Liu, C Wang - Numerical Functional Analysis and …, 2016 - Taylor & Francis
This article presents a novel nonlinear Lagrange algorithm for solving minimax optimization
problems with both inequality and equality constraints, which eliminates the nonsmoothness …

Solving Max-cut Problem with a mixed penalization method for Semidefinite Programming

O Derkaoui, L Ahmed - International Journal of …, 2024 - search.proquest.com
This paper is an attempt to exploit the opportunity of Semi Definite Programming (SDP),
which is an area of convex and conic optimization. Indeed, Numerous NP-hard problems …

[PDF][PDF] Multigrid barrier and penalty methods for large scale topology optimization of solid structures

A Brune - 2022 - etheses.bham.ac.uk
We propose two algorithms for solving minimum compliance topology optimization problems
defined on finite element meshes with several million elements, where the design geometry …