Linear programming with nonparametric penalty programs and iterated thresholding
From MaRDI portal
Publication:5882227
DOI10.1080/10556788.2022.2117356OpenAlexW4304893021MaRDI QIDQ5882227FDOQ5882227
Authors: Jeffery Kline, Glenn Fung 
Publication date: 15 March 2023
Published in: Optimization Methods \& Software (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/10556788.2022.2117356
Recommendations
- scientific article; zbMATH DE number 977754
- scientific article; zbMATH DE number 3635813
- A penalty approach to linear programs with many two-sided constraints
- Exactness conditions for a convex differentiable exterior penalty for linear programming
- Iterative linear programming solution of convex programs
Quadratic programming (90C20) Linear programming (90C05) Numerical methods involving duality (49M29)
Cites Work
- CVXPY: a Python-embedded modeling language for convex optimization
- OSQP: an operator splitting solver for quadratic programs
- An iterative thresholding algorithm for linear inverse problems with a sparsity constraint
- Weak convergence of the sequence of successive approximations for nonexpansive mappings
- A Fixed Point Theorem for Asymptotically Nonexpansive Mappings
- Weak convergence theorems for nonexpansive mappings in Banach spaces
- Exact penalty functions in nonlinear programming
- NONEXPANSIVE NONLINEAR OPERATORS IN A BANACH SPACE
- A Fixed Point Theorem for Mappings which do not Increase Distances
- Necessary and sufficient conditions for a penalty method to be exact
- A primal-dual regularized interior-point method for convex quadratic programs
- Projected Newton Methods for Optimization Problems with Simple Constraints
- Title not available (Why is that?)
- A lower bound for the controlling parameters of the exact penalty functions
- Sufficiency of Exact Penalty Minimization
- A Newton method for linear programming
- Exact Regularization of Convex Programs
- An Exact Potential Method for Constrained Maxima
- Finite perturbation of convex programs
- Sufficient conditions for a globally exact penalty function without convexity
- Piecewise-linear pathways to the optimal solution set in linear programming
- Normal solutions of linear programs
- Title not available (Why is that?)
- Exactness conditions for a convex differentiable exterior penalty for linear programming
Cited In (1)
Uses Software
This page was built for publication: Linear programming with nonparametric penalty programs and iterated thresholding
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5882227)
