Biconvex sets and optimization with biconvex functions: a survey and extensions

DOI10.1007/s00186-007-0161-1zbMath1146.90495OpenAlexW1964590153MaRDI QIDQ2465382

Jochen Gorski, Frank Pfeuffer, Kathrin Klamroth

Publication date: 4 January 2008

Published in: Mathematical Methods of Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00186-007-0161-1

zbMATH Keywords

generalized convexity non-convex optimization biconvex optimization biconvex functions biconcave optimization biconvex sets

Mathematics Subject Classification ID

Nonconvex programming, global optimization (90C26)

Related Items

A block coordinate descent method for sensor network localization ⋮ A nearest-neighbor search model for distance metric learning ⋮ Properties of connected ortho-convex sets in the plane ⋮ Generalized co-sparse factor regression ⋮ Support vector subset scan for spatial pattern detection ⋮ ADJUST: a dictionary-based joint reconstruction and unmixing method for spectral tomography ⋮ Self-calibration and biconvex compressive sensing ⋮ An Alternating Method for Cardinality-Constrained Optimization: A Computational Study for the Best Subset Selection and Sparse Portfolio Problems ⋮ Optimal thermal actuation for mirror temperature control ⋮ Unnamed Item ⋮ On constrained estimation of graphical time series models ⋮ Estimation and inference in semiparametric quantile factor models ⋮ Multivariate Functional Regression Via Nested Reduced-Rank Regularization ⋮ A nonnegative matrix factorization algorithm based on a discrete-time projection neural network ⋮ Continuous maximal covering location problems with interconnected facilities ⋮ Solving Inverse Problems by Joint Posterior Maximization with Autoencoding Prior ⋮ Minimum spanning trees with neighborhoods: mathematical programming formulations and solution methods ⋮ Multi-resource allocation in stochastic project scheduling ⋮ Penalty Alternating Direction Methods for Mixed-Integer Optimization: A New View on Feasibility Pumps ⋮ Ordered \(p\)-median problems with neighbourhoods ⋮ Kronecker Product Approximation of Operators in Spectral Norm via Alternating SDP ⋮ An efficient dictionary-based multi-view learning method ⋮ Combining penalty‐based and Gauss–Seidel methods for solving stochastic mixed‐integer problems ⋮ Robust sensitivity analysis for linear programming with ellipsoidal perturbation ⋮ LOCUS: a regularized blind source separation method with low-rank structure for investigating brain connectivity ⋮ Directed Community Detection With Network Embedding ⋮ Fixed point iteration in identifying bilinear models ⋮ Biconvex Clustering ⋮ Extended mean-conditional value-at-risk portfolio optimization with PADM and conditional scenario reduction technique ⋮ Optimization of the optimal value function in problems of convex parametric programming ⋮ Dictionary-based transfer learning with universum data ⋮ Ambiguous Joint Chance Constraints Under Mean and Dispersion Information ⋮ Solving Highly Detailed Gas Transport MINLPs: Block Separability and Penalty Alternating Direction Methods ⋮ Set estimation under biconvexity restrictions ⋮ Iterative identification of block-oriented nonlinear systems based on biconvex optimization ⋮ Smoothing Partially Exact Penalty Function of Biconvex Programming ⋮ New global algorithms for quadratic programming with a few negative eigenvalues based on alternative direction method and convex relaxation ⋮ Sparse Matrix Graphical Models ⋮ Estrogen receptor expression on breast cancer patients' survival under shape-restricted Cox regression model ⋮ Stochastic geometric optimization with joint probabilistic constraints ⋮ The multi-facility location-allocation problem with polyhedral barriers ⋮ Regularized joint estimation of related vector autoregressive models ⋮ Discrete and geometric branch and bound algorithms for~medical image registration ⋮ Training classifiers for feedback control with safety in mind ⋮ Optimization ⋮ Maximizing perturbation radii for robust convex quadratically constrained quadratic programs ⋮ Linkage Between Piecewise Constant Mumford--Shah Model and Rudin--Osher--Fatemi Model and Its Virtue in Image Segmentation ⋮ Fast approximations of shift-variant blur ⋮ Sparse subspace clustering for data with missing entries and high-rank matrix completion ⋮ Piecewise convexity of artificial neural networks ⋮ Regularized estimation of precision matrix for high-dimensional multivariate longitudinal data ⋮ An optimally concentrated Gabor transform for localized time-frequency components ⋮ An objective penalty function method for biconvex programming ⋮ Relative Robust and Adaptive Optimization ⋮ Transfer learning-based one-class dictionary learning for recommendation data stream ⋮ Bounds for probabilistic programming with application to a blend planning problem ⋮ Enhancing Compressed Sensing 4D Photoacoustic Tomography by Simultaneous Motion Estimation ⋮ Alternating Structure-Adapted Proximal Gradient Descent for Nonconvex Nonsmooth Block-Regularized Problems ⋮ Penalized Classification using Fisher’s Linear Discriminant ⋮ Computing Feasible Points of Bilevel Problems with a Penalty Alternating Direction Method ⋮ Rectangular chance constrained geometric optimization ⋮ Unnamed Item ⋮ New SOCP relaxation and branching rule for bipartite bilinear programs ⋮ A method for discovering the knowledge of item rank from consumer reviews ⋮ Luminance-Chrominance Model for Image Colorization ⋮ A Variational Model for Spatially Weighting in Image Fusion ⋮ Supervised-distributed control with joint performance and communication optimisation ⋮ A neural network approach to solve geometric programs with joint probabilistic constraints ⋮ A distributionally robust perspective on uncertainty quantification and chance constrained programming

Cites Work