Pages that link to "Item:Q2465382"
From MaRDI portal
The following pages link to Biconvex sets and optimization with biconvex functions: a survey and extensions (Q2465382):
Displaying 50 items.
- Iterative identification of block-oriented nonlinear systems based on biconvex optimization (Q491293) (← links)
- An optimally concentrated Gabor transform for localized time-frequency components (Q744473) (← links)
- Rectangular chance constrained geometric optimization (Q779767) (← links)
- Generalized co-sparse factor regression (Q830453) (← links)
- Support vector subset scan for spatial pattern detection (Q830470) (← links)
- Fixed point iteration in identifying bilinear models (Q899172) (← links)
- The multi-facility location-allocation problem with polyhedral barriers (Q960384) (← links)
- On constrained estimation of graphical time series models (Q1662855) (← links)
- Minimum spanning trees with neighborhoods: mathematical programming formulations and solution methods (Q1683122) (← links)
- New global algorithms for quadratic programming with a few negative eigenvalues based on alternative direction method and convex relaxation (Q1741128) (← links)
- Stochastic geometric optimization with joint probabilistic constraints (Q1755848) (← links)
- Discrete and geometric branch and bound algorithms for~medical image registration (Q1761852) (← links)
- Fast approximations of shift-variant blur (Q1800012) (← links)
- Multi-resource allocation in stochastic project scheduling (Q1931636) (← links)
- Regularized joint estimation of related vector autoregressive models (Q2002726) (← links)
- Training classifiers for feedback control with safety in mind (Q2021288) (← links)
- Maximizing perturbation radii for robust convex quadratically constrained quadratic programs (Q2030501) (← links)
- An objective penalty function method for biconvex programming (Q2052381) (← links)
- Transfer learning-based one-class dictionary learning for recommendation data stream (Q2056300) (← links)
- Bounds for probabilistic programming with application to a blend planning problem (Q2060407) (← links)
- A neural network approach to solve geometric programs with joint probabilistic constraints (Q2104380) (← links)
- A block coordinate descent method for sensor network localization (Q2119759) (← links)
- A nearest-neighbor search model for distance metric learning (Q2123495) (← links)
- Optimal thermal actuation for mirror temperature control (Q2160423) (← links)
- A nonnegative matrix factorization algorithm based on a discrete-time projection neural network (Q2179837) (← links)
- Robust sensitivity analysis for linear programming with ellipsoidal perturbation (Q2190327) (← links)
- Estrogen receptor expression on breast cancer patients' survival under shape-restricted Cox regression model (Q2247474) (← links)
- Sparse subspace clustering for data with missing entries and high-rank matrix completion (Q2292193) (← links)
- Piecewise convexity of artificial neural networks (Q2292218) (← links)
- Regularized estimation of precision matrix for high-dimensional multivariate longitudinal data (Q2293546) (← links)
- New SOCP relaxation and branching rule for bipartite bilinear programs (Q2331354) (← links)
- A distributionally robust perspective on uncertainty quantification and chance constrained programming (Q2349116) (← links)
- Properties of connected ortho-convex sets in the plane (Q2364545) (← links)
- Ordered \(p\)-median problems with neighbourhoods (Q2419559) (← links)
- Estimation and inference in semiparametric quantile factor models (Q2658787) (← links)
- Continuous maximal covering location problems with interconnected facilities (Q2668753) (← links)
- Penalized Classification using Fisher’s Linear Discriminant (Q3107201) (← links)
- A method for discovering the knowledge of item rank from consumer reviews (Q3121426) (← links)
- Relative Robust and Adaptive Optimization (Q3386774) (← links)
- Self-calibration and biconvex compressive sensing (Q3458212) (← links)
- Ambiguous Joint Chance Constraints Under Mean and Dispersion Information (Q4604907) (← links)
- Computing Feasible Points of Bilevel Problems with a Penalty Alternating Direction Method (Q4995065) (← links)
- ADJUST: a dictionary-based joint reconstruction and unmixing method for spectral tomography (Q5044977) (← links)
- An Alternating Method for Cardinality-Constrained Optimization: A Computational Study for the Best Subset Selection and Sparse Portfolio Problems (Q5060779) (← links)
- Solving Highly Detailed Gas Transport MINLPs: Block Separability and Penalty Alternating Direction Methods (Q5131727) (← links)
- Set estimation under biconvexity restrictions (Q5140341) (← links)
- Kronecker Product Approximation of Operators in Spectral Norm via Alternating SDP (Q6066100) (← links)
- An efficient dictionary-based multi-view learning method (Q6066132) (← links)
- Combining penalty‐based and Gauss–Seidel methods for solving stochastic mixed‐integer problems (Q6066721) (← links)
- LOCUS: a regularized blind source separation method with low-rank structure for investigating brain connectivity (Q6104114) (← links)
