A study of piecewise linear-quadratic programs
From MaRDI portal
Publication:2194127
DOI10.1007/s10957-020-01716-8zbMath1491.90110arXiv1709.05758OpenAlexW3045179171MaRDI QIDQ2194127
Jong-Shi Pang, Tsung-Hui Chang, Ying Cui, Mingyi Hong
Publication date: 25 August 2020
Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1709.05758
directional stationaritypiecewise linear-quadratic programmingsecond-order directionalsecond-order local optimality theorysemi- and sub-derivatives
Analysis of algorithms and problem complexity (68Q25) Nonconvex programming, global optimization (90C26) Quadratic programming (90C20)
Related Items (8)
Nonconvex and nonsmooth approaches for affine chance-constrained stochastic programs ⋮ Zero-norm regularized problems: equivalent surrogates, proximal MM method and statistical error bound ⋮ Comparing solution paths of sparse quadratic minimization with a Stieltjes matrix ⋮ Optimality Conditions for Nonsmooth Nonconvex-Nonconcave Min-Max Problems and Generative Adversarial Networks ⋮ On continuous selections of polynomial functions ⋮ Linear-step solvability of some folded concave and singly-parametric sparse optimization problems ⋮ Theoretical characteristics and numerical methods for a class of special piecewise quadratic optimization ⋮ Asymptotic Properties of Stationary Solutions of Coupled Nonconvex Nonsmooth Empirical Risk Minimization
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Extending piecewise polynomial functions in two variables
- Technical note: Directional derivatives in nonsmooth optimization
- Second-order directional derivatives for nonsmooth functions
- Une caractérisation complete des minima locaux en programmation quadratique
- Quadratic programming with one negative eigenvalue is NP-hard
- On the structure of convex piecewise quadratic functions
- On the pervasiveness of difference-convexity in optimization and statistics
- Quadratic programming and affine variational inequalities. A qualitative study.
- A property of piecewise smooth functions
- On concepts of directional differentiability
- A nonsmooth version of Newton's method
- A nonsmooth Morse--Sard theorem for subanalytic functions
- Quadratic programming is in NP
- Optimization and nonsmooth analysis
- Some NP-complete problems in quadratic and nonlinear programming
- Computational complexity of parametric linear programming
- Necessary and sufficient optimality conditions for a class of nonsmooth minimization problems
- A unified theory of first and second order conditions for extremum problems in topological vector spaces
- Generalized equations and their solutions, part II: Applications to nonlinear programming
- Semismooth and Semiconvex Functions in Constrained Optimization
- Continuous selections of linear functions and nonsmooth critical point theory
- Composite Difference-Max Programs for Modern Statistical Estimation Problems
- Necessary and sufficient conditions for quadratic minimality
- Finite-Dimensional Variational Inequalities and Complementarity Problems
- Computationally Related Problems
- Optimality conditions for quadratic programming
- Indefinite copositive matrices with exactly one positive eigenvalue or exactly one negative eigenvalue
This page was built for publication: A study of piecewise linear-quadratic programs