On the pervasiveness of difference-convexity in optimization and statistics
From MaRDI portal
Publication:1739035
DOI10.1007/s10107-018-1286-0zbMath1434.90155arXiv1704.03535OpenAlexW2605585793MaRDI QIDQ1739035
Maher Nouiehed, Jong-Shi Pang, Meisam Razaviyayn
Publication date: 24 April 2019
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1704.03535
learningnonconvex optimizationstatistical estimationdc-functionscomposite risk functionalsquadratic recours
Related Items
Preference Robust Modified Optimized Certainty Equivalent, Nonconvex and nonsmooth approaches for affine chance-constrained stochastic programs, A unifying framework of high-dimensional sparse estimation with difference-of-convex (DC) regularizations, A study of piecewise linear-quadratic programs, Computation of the maximum likelihood estimator in low-rank factor analysis, A three-operator splitting algorithm with deviations for generalized DC programming, Correction to: On the pervasiveness of difference-convexity in optimization and statistics, Piecewise affine parameterized value-function based bilevel non-cooperative games, Two-Stage Stochastic Programming with Linearly Bi-parameterized Quadratic Recourse, Solving Nonsmooth and Nonconvex Compound Stochastic Programs with Applications to Risk Measure Minimization
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A stochastic successive minimization method for nonsmooth nonconvex optimization with applications to transceiver design in wireless communication networks
- DC approximation approaches for sparse optimization
- An LPCC approach to nonconvex quadratic programs
- On functions representable as a difference of convex functions
- On the surfaces representable as difference of convex functions
- On the structure of convex piecewise quadratic functions
- Convex analysis approach to d. c. programming: Theory, algorithms and applications
- Max-min representation of piecewise linear functions
- Two-stage non-cooperative games with risk-averse players
- DC programming and DCA: thirty years of developments
- DC formulations and algorithms for sparse optimization problems
- A study of the difference-of-convex approach for solving linear programs with complementarity constraints
- Quadratic programming and affine variational inequalities. A qualitative study.
- The DC (Difference of convex functions) programming and DCA revisited with DC models of real world nonconvex optimization problems
- Value-at-risk optimization using the difference of convex algorithm
- DC programming: overview.
- Generalized deviations in risk analysis
- Optimality conditions in portfolio analysis with general deviation measures
- Strong oracle optimality of folded concave penalized estimation
- Non-cooperative games
- A Unified Convergence Analysis of Block Successive Minimization Methods for Nonsmooth Optimization
- Introduction to Piecewise Differentiable Equations
- Computing B-Stationary Points of Nonsmooth DC Programs
- Penalty Functions and Duality in Stochastic Programming Via ϕ-Divergence Functionals
- Expected Utility, Penalty Functions, and Duality in Stochastic Nonlinear Programming
- On difference convexity of locally Lipschitz functions
- Lectures on Stochastic Programming
- On compositions of d.c. functions and mappings
- Optimization and nonsmooth analysis
- Global minimization of a difference of two convex functions
- Error Bound and Convergence Analysis of Matrix Splitting Algorithms for the Affine Variational Inequality Problem
- Introduction to Stochastic Programming
- Composite Difference-Max Programs for Modern Statistical Estimation Problems
- Decomposition by Partial Linearization: Parallel Optimization of Multi-Agent Systems
- A New Decomposition Method for Multiuser DC-Programming and Its Applications
- Finite-Dimensional Variational Inequalities and Complementarity Problems
- Iterative Solution of Nonlinear Equations in Several Variables
- Difference-of-Convex Learning: Directional Stationarity, Optimality, and Sparsity
- AN OLD‐NEW CONCEPT OF CONVEX RISK MEASURES: THE OPTIMIZED CERTAINTY EQUIVALENT
- On Quadratic Programming
- Mathematical Programs with Equilibrium Constraints
- Convex analysis and global optimization
