Amanote Research

Amanote Research

    RegisterSign 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 ProbstDanda Pani PaudelAjad ChhatkuliLuc Van Gool
Publisher

IEEE


Related search

Convex Relaxations and Approximations of Chance-Constrained AC-OPF Problems

IEEE Transactions on Power Systems
Electronic EngineeringPower TechnologyElectricalEnergy Engineering
2019English

Convex Relaxations in Nonconvex and Applied Optimization

English

Some Optimization Problems for the Minimal Annulus of a Convex Set

Mathematical Inequalities and Applications
MathematicsApplied Mathematics
2006English

A Primal-Dual Consensus Algorithm for Convex Problems From Network Control and Estimation*

IFAC Proceedings Volumes
2011English

Constraint Logic Programming for Non Convex NLP and MINLP Problems

IFAC Proceedings Volumes
2006English

Duality Theorems for Non-Convex Mixed Integer Programming Problems

International Journal of Computing and Optimization
2016English

Analysis of LP Relaxations for Multiway and Multicut Problems

Networks
Information SystemsComputer NetworksHardwareCommunicationsArchitectureSoftware
1999English

Inequalities for Convex and Non-Convex Functions

Applied Mathematical Sciences
2014English

Semidefinite Relaxations of Ordering Problems

Mathematical Programming, Series B
MathematicsSoftware
2013English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2025 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy