Amanote Research
Register
Sign In
Convex Relaxations for Consensus and Non-Minimal Problems in 3D Vision
doi 10.1109/iccv.2019.01033
Full Text
Open PDF
Abstract
Available in
full text
Date
October 1, 2019
Authors
Thomas Probst
Danda Pani Paudel
Ajad Chhatkuli
Luc Van Gool
Publisher
IEEE
Related search
Convex Relaxations and Approximations of Chance-Constrained AC-OPF Problems
IEEE Transactions on Power Systems
Electronic Engineering
Power Technology
Electrical
Energy Engineering
Convex Relaxations in Nonconvex and Applied Optimization
Some Optimization Problems for the Minimal Annulus of a Convex Set
Mathematical Inequalities and Applications
Mathematics
Applied Mathematics
A Primal-Dual Consensus Algorithm for Convex Problems From Network Control and Estimation*
IFAC Proceedings Volumes
Constraint Logic Programming for Non Convex NLP and MINLP Problems
IFAC Proceedings Volumes
Duality Theorems for Non-Convex Mixed Integer Programming Problems
International Journal of Computing and Optimization
Analysis of LP Relaxations for Multiway and Multicut Problems
Networks
Information Systems
Computer Networks
Hardware
Communications
Architecture
Software
Inequalities for Convex and Non-Convex Functions
Applied Mathematical Sciences
Semidefinite Relaxations of Ordering Problems
Mathematical Programming, Series B
Mathematics
Software