Bilinear separation of two sets in \(n\)-space
From MaRDI portal
Publication:1315445
DOI10.1007/BF01299449zbMath0795.90060MaRDI QIDQ1315445
Kristin P. Bennett, Olvi L. Mangasarian
Publication date: 10 March 1994
Published in: Computational Optimization and Applications (Search for Journal in Brave)
Nonlinear programming (90C30) Neural networks for/in biological studies, artificial life and related topics (92B20)
Related Items
Solving dynamic public insurance games with endogenous agent distributions: theory and computational approximation, A characterization of 2-threshold functions via pairs of prime segments, Misclassification minimization, Information-theoretic feature selection with discrete \(k\)-median clustering, An outcome-space finite algorithm for solving linear multiplicative programming, Data separation via a finite number of discriminant functions: a global optimization approach, Absolute value equations, Global optimization algorithm for solving linear multiplicative programming problems, On the extended linear complementarity problem, An accelerating outer space algorithm for globally solving generalized linear multiplicative problems, An efficient spatial branch-and-bound algorithm using an adaptive branching rule for linear multiplicative programming, Segmenting Strings Homogeneously Via Trees, Robust approach for air cargo freight forwarder selection under disruption, Globally minimizing a class of linear multiplicative forms via simplicial branch-and-bound, Mathematical Programming Formulations and Algorithms for Discrete k-Median Clustering of Time-Series Data, A practicable branch-and-bound algorithm for globally solving linear multiplicative programming, Global optimization for generalized linear multiplicative programming using convex relaxation, On Deterministic Reformulations of Distributionally Robust Joint Chance Constrained Optimization Problems, Auction optimization using regression trees and linear models as integer programs, Primal-dual bilinear programming solution of the absolute value equation, Homogeneous string segmentation using trees and weighted independent sets, The inverse optimal value problem, Global optimization in protein docking using clustering, underestimation and semidefinite programming, Nonlinear separation of data via mixed 0-1 integer and linear programming, Polyhedral separability through successive LP, Spherical classification of data, a new rule-based learning method, The linear complementarity problem as a separable bilinear program, A nonisolated optimal solution of general linear multiplicative programming problems, Solving nonnegative sparsity-constrained optimization via DC quadratic-piecewise-linear approximations, A complementarity approach to a quasistatic multi-rigid-body contact problem, Global Optimization of Linear Multiplicative Programming Using Univariate Search, A novel convex relaxation-strategy-based algorithm for solving linear multiplicative problems, Arbitrary-norm separating plane, Approximating a linear multiplicative objective in watershed management optimization, Hybrid extreme point tabu search, Global optimization method for linear multiplicative programming
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A note on the solution of bilinear programming problems by reduction to concave minimization
- On the complexity of polyhedral separability
- Efficient algorithms for solving rank two and rank three bilinear programming problems
- A linear programming approach to solving bilinear programmes
- Linear multiplicative programming
- Polynomial time algorithms for some classes of constrained nonconvex quadratic problems
- Multisurface method of pattern separation for medical diagnosis applied to breast cytology.
- Jointly Constrained Biconvex Programming
- Characterization of linear complementarity problems as linear programs
- Linear and Nonlinear Separation of Patterns by Linear Programming
- Multisurface method of pattern separation
- Convex Analysis
