The Concave-Convex Procedure
From MaRDI portal
Publication:4408935
Recommendations
- A proof of convergence of the concave-convex procedure using Zangwill's theory
- CCCP Algorithms to Minimize the Bethe and Kikuchi Free Energies: Convergent Alternatives to Belief Propagation
- A family of CCCP algorithms which minimize the TRW free energy
- Variations and extension of the convex-concave procedure
- Convexity arguments for efficient minimization of the Bethe and Kikuchi free energies
Cites work
- A Relationship Between Arbitrary Positive Matrices and Doubly Stochastic Matrices
- An introduction to variational methods for graphical models
- Another interpretation of the EM algorithm for mixture distributions
- CCCP Algorithms to Minimize the Bethe and Kikuchi Free Energies: Convergent Alternatives to Belief Propagation
- Exponentiated gradient versus gradient descent for linear predictors
- Generalized Iterative Scaling for Log-Linear Models
- Iterative algorithms for deblurring and deconvolution with constraints
- The invisible hand algorithm: solving the assignment problem with statistical physics
Cited in
(only showing first 100 items - show all)- Surrogate maximization/minimization algorithms and extensions
- A modified local quadratic approximation algorithm for penalized optimization problems
- Sparse high-dimensional fractional-norm support vector machine via DC programming
- Robust truss topology optimization via semidefinite programming with complementarity constraints: a difference-of-convex programming approach
- High-dimensional penalty selection via minimum description length principle
- Expectile regression for analyzing heteroscedasticity in high dimension
- Homogeneity detection for the high-dimensional generalized linear model
- Visualizing the effects of a changing distance on data using continuous embeddings
- The use of random-effect models for high-dimensional variable selection problems
- Moderately clipped Lasso
- A random-effect model approach for group variable selection
- Maximum margin semi-supervised learning with irrelevant data
- A data-driven approach to robust control of multivariable systems by convex optimization
- A doubly sparse approach for group variable selection
- Homotopy continuation approaches for robust SV classification and regression
- High-dimensional grouped folded concave penalized estimation via the LLA algorithm
- DC programming and DCA: thirty years of developments
- Continuous relaxation for discrete DC programming
- Dictionary learning for fast classification based on soft-thresholding
- Robust support vector regression in the primal
- A nonlinear fourth-order PDE for image denoising in Sobolev spaces with variable exponents and its numerical algorithm
- Support points
- Multiple-source adaptation theory and algorithms
- A preconditioned difference of convex algorithm for truncated quadratic regularization with application to imaging
- Graph-based semi-supervised learning via improving the quality of the graph dynamically
- Solving certain complementarity problems in power markets via convex programming
- Robust moderately clipped LASSO for simultaneous outlier detection and variable selection
- A convex relaxation framework consisting of a primal-dual alternative algorithm for solving \(\ell_0\) sparsity-induced optimization problems with application to signal recovery based image restoration
- Data clustering based on the modified relaxation Cheeger cut model
- Penalized generalized estimating equations approach to longitudinal data with multinomial responses
- A generalized proximal linearized algorithm for DC functions with application to the optimal size of the firm problem
- Revisiting strategies for fitting logistic regression for positive and unlabeled data
- A unifying framework of high-dimensional sparse estimation with difference-of-convex (DC) regularizations
- Oscillations in mixed-feedback systems
- Robust support vector regression with generic quadratic nonconvex \(\varepsilon\)-insensitive loss
- A robust outlier control framework for classification designed with family of homotopy loss function
- Large-scale regression with non-convex loss and penalty
- Robust regularized extreme learning machine for regression with non-convex loss function via DC program
- Kernel machines with missing responses
- Minimizing a sum of clipped convex functions
- Optimal portfolio deleveraging under market impact and margin restrictions
- Optimization of robust loss functions for weakly-labeled image taxonomies
- Diffuse interface methods for multiclass segmentation of high-dimensional data
- Variations and extension of the convex-concave procedure
- Majorization-minimization generalized Krylov subspace methods for \({\ell _p}\)-\({\ell _q}\) optimization applied to image restoration
- Binary classification via spherical separator by DC programming and DCA
- Multiclass maximum margin clustering via immune evolutionary algorithm for automatic diagnosis of electrocardiogram arrhythmias
- Convergence of the graph Allen-Cahn scheme
- Penalized expectile regression: an alternative to penalized quantile regression
- A normalized gradient flow method with attractive-repulsive splitting for computing ground states of Bose-Einstein condensates with higher-order interaction
- Computation of the maximum likelihood estimator in low-rank factor analysis
- Calibrating nonconvex penalized regression in ultra-high dimension
- A DC programming approach for feature selection in support vector machines learning
- A sparse large margin semi-supervised learning method
- Efficient nonsmooth nonconvex optimization for image restoration and segmentation
- A family of CCCP algorithms which minimize the TRW free energy
- Exponential squared loss based robust variable selection of AR models
- Diffuse interface models on graphs for classification of high dimensional data
- Coordinate Coding on the Riemannian Manifold of Symmetric Positive-Definite Matrices for Image Classification
- MIMO PID tuning via iterated LMI restriction
- Tikhonov, Ivanov and Morozov regularization for support vector machine learning
- Learning sparse classifiers with difference of convex functions algorithms
- Least squares twin support vector machine classification via maximum one-class within class variance
- Training robust support vector regression with smooth non-convex loss function
- A proof of convergence of the concave-convex procedure using Zangwill's theory
- Multiple kernel learning with gaussianity measures
- DCA based algorithms for multiple sequence alignment (MSA)
- A stochastic successive minimization method for nonsmooth nonconvex optimization with applications to transceiver design in wireless communication networks
- Quantile regression models for current status data
- CCCP Algorithms to Minimize the Bethe and Kikuchi Free Energies: Convergent Alternatives to Belief Propagation
- DC programming and DCA for general DC programs
- Skew Jensen-Bregman Voronoi diagrams
- Supervised classification and mathematical optimization
- A closedness condition and its applications to DC programs with convex constraints
- A new iterative algorithm for mean curvature-based variational image denoising
- A majorization-minimization approach to the sparse generalized eigenvalue problem
- Multi-instance multi-label learning
- Quadratic approximation for nonconvex penalized estimations with a diverging number of parameters
- Enhancing statistical performance of data-driven controller tuning via \(\mathcal{L}_2-\)regularization
- Sequential convex programming for computing information-theoretic minimal partitions: nonconvex nonsmooth optimization
- Fuzzy clustering based on nonconvex optimisation approaches using difference of convex (DC) functions algorithms
- Stochastic Reasoning, Free Energy, and Information Geometry
- Log-concavity and strong log-concavity: a review
- Approximate penalization path for smoothly clipped absolute deviation
- A framework of discrete DC programming by discrete convex analysis
- Multiplicative Updates for NMF with $\beta$-Divergences under Disjoint Equality Constraints
- scientific article; zbMATH DE number 7626767 (Why is no real title available?)
- Confidence Bands for a Log-Concave Density
- A hybrid method for solving non-convex min-max quadratic fractional problems under quadratic constraints
- Operator splitting for adaptive radiation therapy with nonlinear health dynamics
- Efficient minimization of higher order submodular functions using monotonic Boolean functions
- Sparse principal component analysis in Hilbert space
- Convergence guarantees for a class of non-convex and non-smooth optimization problems
- A bilateral-truncated-loss based robust support vector machine for classification problems
- Sparse optimization for nonconvex group penalized estimation
- Conic geometric optimization on the manifold of positive definite matrices
- Morphological Perceptrons: Geometry and Training Algorithms
- Continuous relaxation for discrete DC programming
- Block clustering based on difference of convex functions (DC) programming and DC algorithms
- Spontaneous clustering via minimum gamma-divergence
This page was built for publication: The Concave-Convex Procedure
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4408935)
