A study on sequential minimal optimization methods for standard quadratic problems
type: Item
instance of: scholarly article
title: A study on sequential minimal optimization methods for standard quadratic problems
author: Riccardo Bisori
author: Matteo Lapucci
author: Marco Sciandrone
published in: 4OR
publication date: 2022-11-17T00:00:00Z
Mathematics Subject Classification ID: 90C20
zbMATH DE Number: 7618969
zbMATH Keywords: decomposition algorithm
zbMATH Keywords: sequential minimal optimization algorithm
describes a project that uses: LIBSVM
describes a project that uses: NumPy
describes a project that uses: Gurobi
describes a project that uses: Ipopt
describes a project that uses: TOMP
describes a project that uses: SciPy
describes a project that uses: Python
MaRDI profile type: Publication
full work available at URL: s10288-021-00496-9
OpenAlex ID: W3211827832
cites work: On standard quadratic optimization problems
cites work: Branch-and-bound approaches to standard quadratic optimization problems
cites work: Regularity versus Degeneracy in Dynamics, Games, and Optimization: A Unified Approach to Different Aspects
cites work: Solving standard quadratic optimization problems via linear, semidefinite and copositive pro\-gramming
cites work: Quartic formulation of standard quadratic optimization problems
cites work: Unconstrained formulation of standard quadratic optimization problems
cites work: The Complexity of Simple Models—A Study of Worst and Typical Hard Cases for the Standard Quadratic Optimization Problem
cites work: An Adaptive Linear Approximation Algorithm for Copositive Programs
cites work: Support-vector networks
cites work: Using SVM to combine global heuristics for the standard quadratic problem
cites work: Benchmarking optimization software with performance profiles.
cites work: Q3093324
cites work: Continuous Characterizations of the Maximum Clique Problem
cites work: Global solutions of nonconvex standard quadratic programs via mixed integer linear programming reformulations
cites work: Introduction to global optimization.
cites work: Q4286721
cites work: Improvements to Platt's SMO Algorithm for SVM Classifier Design
cites work: Q3289487
cites work: Algorithm 733: TOMP–Fortran modules for optimal control calculations
cites work: A new branch-and-bound algorithm for standard quadratic programming problems
cites work: The general mean-variance portfolio selection problem
cites work: Maxima for Graphs and a New Proof of a Theorem of Turán
cites work: A new semidefinite programming bound for indefinite quadratic forms over a simplex
cites work: Nonlinear optimization and support vector machines
cites work: A clique algorithm for standard quadratic programming
cites work: On the implementation of an interior-point filter line-search algorithm for large-scale nonlinear programming
cites work: Random constraint satisfaction: easy generation of hard (satisfiable) instances
DOI: 10.1007/S10288-021-00496-9
description: scientific article; zbMATH DE number 7618969