Disciplined biconvex programming
From MaRDI portal
Cites work
- rm K-SVD: An Algorithm for Designing Overcomplete Dictionaries for Sparse Representation
- A geometrical characterization of Banach spaces in which martingale difference sequences are unconditional
- Active learning for discrete latent variable models
- An Algorithm for Separable Nonconvex Programming Problems
- Bi-convexity and bi-martingales
- Biconvex sets and optimization with biconvex functions: a survey and extensions
- Bilinear matrix inequality‐based nonquadratic controller design for polytopic‐linear parameter varying systems
- Blind image deconvolution. Methods and convergence
- Branch-and-Bound Methods: A Survey
- Conic optimization via operator splitting and homogeneous self-dual embedding
- Continuity of Measurable Convex and Biconvex Operators
- Convex Analysis
- CVXPY: a Python-embedded modeling language for convex optimization
- Deterministic global optimization. Theory, methods and applications
- Directional derivates and almost everywhere differentiability of biconvex and concave-convex operators.
- Disciplined convex programming
- Disciplined geometric programming
- Disciplined quasiconvex programming
- Distributed optimization and statistical learning via the alternating direction method of multipliers
- Estimating price elasticity matrices
- Generalized low rank models
- scientific article; zbMATH DE number 976325 (Why is no real title available?)
- scientific article; zbMATH DE number 756188 (Why is no real title available?)
- scientific article; zbMATH DE number 2107836 (Why is no real title available?)
- scientific article; zbMATH DE number 5060482 (Why is no real title available?)
- scientific article; zbMATH DE number 5066287 (Why is no real title available?)
- Jointly Constrained Biconvex Programming
- Learning the parts of objects by non-negative matrix factorization
- Least squares quantization in PCM
- Minimization of a Non-Separable Objective Function Subject to Disjoint Constraints
- Minimizing Certain Convex Functions
- On Burkholder's Biconvex-Function Characterization of Hilbert Spaces
- On search directions for minimization algorithms
- On the implementation of an interior-point filter line-search algorithm for large-scale nonlinear programming
- OSQP: an operator splitting solver for quadratic programs
- Partially monotone operators and the generic differentiability of convex- concave and biconvex mappings
- Primal-relaxed dual global optimization approach
- Robust stability of systems with both parametric and dynamic uncertainties
- Robust stability of the systems with mixed uncertainties under the IQC descriptions
- Scikit-learn: machine learning in Python
- Solving a low-rank factorization model for matrix completion by a nonlinear successive over-relaxation algorithm
This page was built for publication: Disciplined biconvex programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7405115)
