Sciweavers

318 search results - page 8 / 64
» On the equivalence of linear complementarity problems
Sort
View
ANNPR
2006
Springer
13 years 11 months ago
Fast Training of Linear Programming Support Vector Machines Using Decomposition Techniques
Abstract. Decomposition techniques are used to speed up training support vector machines but for linear programming support vector machines (LP-SVMs) direct implementation of decom...
Yusuke Torii, Shigeo Abe
EOR
2006
79views more  EOR 2006»
13 years 7 months ago
Equilibrium constrained optimization problems
ABSTRACT. We consider equilibrium constrained optimization problems, which have a general formulation that encompasses well-known models such as mathematical programs with equilibr...
S. Ilker Birbil, Gemayqzel Bouza, J. B. G. Frenk, ...
SIAMCO
2010
97views more  SIAMCO 2010»
13 years 2 months ago
Real-Time Nonlinear Optimization as a Generalized Equation
Abstract. We establish results for the problem of tracking a time-dependent manifold arising in realtime optimization by casting this as a parametric generalized equation. We demon...
Victor M. Zavala, Mihai Anitescu
CORR
2008
Springer
95views Education» more  CORR 2008»
13 years 7 months ago
A Simple Algebraic Formulation for the Scalar Linear Network Coding Problem
In this work, we derive an algebraic formulation for the scalar linear network coding problem as an alternative to the one presented by Koetter et al in [1]. Using an equivalence b...
Abhay T. Subramanian, Andrew Thangaraj
COMBINATORICS
2006
98views more  COMBINATORICS 2006»
13 years 7 months ago
Shift Equivalence of P-finite Sequences
We present an algorithm which decides the shift equivalence problem for Pfinite sequences. A sequence is called P-finite if it satisfies a homogeneous linear recurrence equation w...
Manuel Kauers