On the public citation graph

A Relaxation Method for Binary Orthogonal Optimization Problems with its Applications

https://doi.org/10.2139/ssrn.4901588
0 signed · 39 inferred · view as graph

Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.

Is this your work? Sign in with ORCID and put your name on the claims that are yours.
Claim with ORCID
Reference health. See whether every reference in this work resolves to a known work and none has been retracted — and get a dated CiteStamped badge you can embed.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1007/978-1-4612-1478-6openalex-snapshot
Orthogonal Arrays
inferredcites →https://doi.org/10.1007/978-3-319-46454-1_14openalex-snapshot
Learning to Hash with Binary Deep Neural Network
inferredcites →https://doi.org/10.1007/978-3-642-33715-4_25openalex-snapshot
Multidimensional Spectral Hashing
inferredcites →https://doi.org/10.1007/s10898-018-0675-5openalex-snapshot
Equivalent Lipschitz surrogates for zero-norm and rank optimization problems
inferredcites →https://doi.org/10.1007/s11228-008-0076-xopenalex-snapshot
On Metric and Calmness Qualification Conditions in Subdifferential Calculus
inferredcites →https://doi.org/10.1016/j.sigpro.2023.109255openalex-snapshot
SCH: Symmetric Consistent Hashing for cross-modal retrieval
inferredcites →https://doi.org/10.1017/9781009166164openalex-snapshot
An Introduction to Optimization on Smooth Manifolds
inferredcites →https://doi.org/10.1023/a:1020587701058openalex-snapshot
Nonmonotone Globalization Techniques for the Barzilai-Borwein Gradient Method
inferredcites →https://doi.org/10.1093/imanum/8.1.141openalex-snapshot
Two-Point Step Size Gradient Methods
inferredcites →https://doi.org/10.1093/imanum/drac018openalex-snapshot
A manifold inexact augmented Lagrangian method for nonsmooth optimization on Riemannian submanifolds in Euclidean space
inferredcites →https://doi.org/10.1093/imanum/drac084openalex-snapshot
Error bound and exact penalty method for optimization problems with nonnegative orthogonal constraint
inferredcites →https://doi.org/10.1093/imanum/drx080openalex-snapshot
Global rates of convergence for nonconvex optimization on manifolds
inferredcites →https://doi.org/10.1109/cvpr.2012.6247912openalex-snapshot
Supervised hashing with kernels
inferredcites →https://doi.org/10.1109/cvpr.2014.275openalex-snapshot
Collaborative Hashing
inferredcites →https://doi.org/10.1109/cvpr.2015.7298598openalex-snapshot
Supervised Discrete Hashing
inferredcites →https://doi.org/10.1109/icassp.2008.4518374openalex-snapshot
Sparse reconstruction by separable approximation
inferredcites →https://doi.org/10.1109/tbdata.2016.2516024openalex-snapshot
Robust Discrete Spectral Hashing for Large-Scale Image Semantic Indexing
inferredcites →https://doi.org/10.1109/tcsvt.2020.3040863openalex-snapshot
Reinforced Short-Length Hashing
inferredcites →https://doi.org/10.1109/tip.2016.2612883openalex-snapshot
A Fast Optimization Method for General Binary Code Learning
inferredcites →https://doi.org/10.1109/tip.2017.2749147openalex-snapshot
Hashing with Angular Reconstructive Embeddings
inferredcites →https://doi.org/10.1109/tip.2018.2875312openalex-snapshot
Discrete Spectral Hashing for Efficient Similarity Retrieval
inferredcites →https://doi.org/10.1109/tip.2020.2963952openalex-snapshot
Strongly Constrained Discrete Hashing
inferredcites →https://doi.org/10.1109/tip.2020.3014727openalex-snapshot
Unsupervised Deep Cross-modality Spectral Hashing
inferredcites →https://doi.org/10.1109/tip.2021.3091895openalex-snapshot
Unsupervised Discrete Hashing With Affinity Similarity
inferredcites →https://doi.org/10.1109/tip.2022.3195059openalex-snapshot
Joint Specifics and Consistency Hash Learning for Large-Scale Cross-Modal Retrieval
inferredcites →https://doi.org/10.1109/tip.2023.3251025openalex-snapshot
Hierarchical Hashing Learning for Image Set Classification
inferredcites →https://doi.org/10.1109/tmm.2012.2199970openalex-snapshot
Spectral Hashing With Semantically Consistent Graph for Image Indexing
inferredcites →https://doi.org/10.1109/tnnls.2016.2636870openalex-snapshot
Supervised Discrete Hashing With Relaxation
inferredcites →https://doi.org/10.1109/tpami.2012.193openalex-snapshot
Iterative Quantization: A Procrustean Approach to Learning Binary Codes for Large-Scale Image Retrieval
inferredcites →https://doi.org/10.1109/tpami.2017.2678475openalex-snapshot
Fast Supervised Discrete Hashing
inferredcites →https://doi.org/10.1109/tpami.2021.3070753openalex-snapshot
A Generalized Method for Binary Optimization: Convergence Analysis and Applications
inferredcites →https://doi.org/10.1109/tsp.2009.2016892openalex-snapshot
Sparse Reconstruction by Separable Approximation
inferredcites →https://doi.org/10.1137/0723046openalex-snapshot
A Nonmonotone Line Search Technique for Newton’s Method
inferredcites →https://doi.org/10.1137/18m122457xopenalex-snapshot
Proximal Gradient Method for Nonsmooth Optimization over the Stiefel Manifold
inferredcites →https://doi.org/10.1137/18m1232498openalex-snapshot
Directional Quasi-/Pseudo-Normality as Sufficient Conditions for Metric Subregularity
inferredcites →https://doi.org/10.1145/1835449.1835455openalex-snapshot
Self-taught hashing for fast similarity search
inferredcites →https://doi.org/10.1515/9781400830244openalex-snapshot
Optimization Algorithms on Matrix Manifolds
inferredcites →https://doi.org/10.1609/aaai.v31i1.10831openalex-snapshot
Asymmetric Discrete Graph Hashing
inferredcites →https://doi.org/10.24963/ijcai.2019/420openalex-snapshot
Supervised Short-Length Hashing
Editorial review for independent work. ICSAC — the Institute for Complexity Science and Advanced Computing — runs a structured editorial panel for researchers publishing outside journals, and publishes on CiteStamp rails. Submission is free and goes through ORCID: icsacinstitute.org/submit.