Ellipsoidal one-class constraint acquisition for quadratically constrained programming

DOI10.1016/j.ejor.2020.12.018zbMath1487.90489OpenAlexW3118748823MaRDI QIDQ2030498

Tomasz P. Pawlak, Bartosz Litwiniuk

Publication date: 7 June 2021

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejor.2020.12.018

zbMATH Keywords

quadratic programmingartificial intelligencesystem modelingprocess miningbusiness process

Mathematics Subject Classification ID

Mixed integer programming (90C11) Learning and adaptive systems in artificial intelligence (68T05) Quadratic programming (90C20)

Related Items (1)

Continuous discovery of causal nets for non-stationary business processes using the Online Miner

Uses Software

• AMPL
• Gurobi
• Accord.NET
• C4.5
• PyClustering
• PRMLT

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Structured learning modulo theories
• Empirical decision model learning
• A new polynomial-time algorithm for linear programming
• An optimal convex hull algorithm in any fixed dimension
• Evolution strategies. A comprehensive introduction
• Automatic synthesis of constraints from examples using mixed integer linear programming
• Support-vector networks
• Smoothing methods in statistics
• Machine Learning
• 10.1162/15324430260185574
• Inverse Optimization

This page was built for publication: Ellipsoidal one-class constraint acquisition for quadratically constrained programming