Nonlinear Perturbation of Linear Programs
From MaRDI portal
Publication:3870660
DOI10.1137/0317052zbMath0432.90047OpenAlexW2131448432MaRDI QIDQ3870660
Robert R. Meyer, Olvi L. Mangasarian
Publication date: 1979
Published in: SIAM Journal on Control and Optimization (Search for Journal in Brave)
Full work available at URL: http://digital.library.wisc.edu/1793/58094
nonlinear perturbationKarush-Kuhn-Tucker pointperturbation by continuous functionsperturbed programs
Nonlinear programming (90C30) Linear programming (90C05) Markov and semi-Markov decision processes (90C40)
Related Items (56)
A fast \(\ell_1\)-solver and its applications to robust face recognition ⋮ Data parallel computing for network-structured optimization problems ⋮ On a class of controlled differential variational inequalities ⋮ Sparse solutions to an underdetermined system of linear equations via penalized Huber loss ⋮ Sparsity-preserving SOR algorithms for separable quadratic and linear programming ⋮ Proximal minimizations with \(D\)-functions and the massively parallel solution of linear network programs ⋮ A new result in the theory and computation of the least-norm solution of a linear program ⋮ Distributed Linear Programming with Event-Triggered Communication ⋮ Finding normal solutions in piecewise linear programming ⋮ Piecewise-linear pathways to the optimal solution set in linear programming ⋮ Iterative schemes for the least 2-norm solution of piecewise linear programs ⋮ Error estimates and Lipschitz constants for best approximation in continuous function spaces ⋮ Least-norm linear programming solution as an unconstrained minimization problem ⋮ An improved multi-parametric programming algorithm for flux balance analysis of metabolic networks ⋮ Absolute value programming ⋮ \(l_{p}\)-norm regularization method (\( 0<p<1 \)) and DC programming for correction system of inconsistency linear inequalities ⋮ On finite convergence of iterative methods for variational inequalities in Hilbert spaces ⋮ PAL-Hom method for QP and an application to LP ⋮ Laplacian pair-weight vector projection for semi-supervised learning ⋮ An improved robust and sparse twin support vector regression via linear programming ⋮ On Stochastic and Deterministic Quasi-Newton Methods for Nonstrongly Convex Optimization: Asymptotic Convergence and Rate Analysis ⋮ Accelerated linearized Bregman method ⋮ A finite algorithm for the least two-norm solution of a linear program1 ⋮ On the minimum norm solution of linear programs ⋮ Identification of chimera using machine learning ⋮ An Asymptotically Superlinearly Convergent Semismooth Newton Augmented Lagrangian Method for Linear Programming ⋮ Constructing New Weighted ℓ1-Algorithms for the Sparsest Points of Polyhedral Sets ⋮ A first order method for finding minimal norm-like solutions of convex optimization problems ⋮ A row relaxation method for large \(l_ 1\) problems ⋮ Characterization of weakly sharp solutions of a variational-type inequality with convex functional ⋮ Finite termination of inexact proximal point algorithms in Hilbert spaces ⋮ Characterization results of weak sharp solutions for split variational inequalities with application to traffic analysis ⋮ Minimum principle sufficiency ⋮ A cutting plane method for solving minimax problems in the complex plane ⋮ A row relaxation method for large minimax problems ⋮ Robust screening under ambiguity ⋮ An iteratively approximated gradient projection algorithm for sparse signal reconstruction ⋮ Templates for convex cone problems with applications to sparse signal recovery ⋮ A primal-dual regularized interior-point method for convex quadratic programs ⋮ A generalized Newton algorithm for quantile regression models ⋮ New necessary optimality conditions in optimistic bilevel programming ⋮ A Newton method for linear programming ⋮ On Controlled Variational Inequalities Involving Convex Functionals ⋮ Distributed optimal load frequency control considering nonsmooth cost functions ⋮ On multilevel iterative methods for optimization problems ⋮ Error bounds for nondegenerate monotone linear complementarity problems ⋮ Techniques of linear programming based on the theory of convex cones ⋮ Necessary and Sufficient Conditions for Noiseless Sparse Recovery via Convex Quadratic Splines ⋮ Global minimization via piecewise-linear underestimation ⋮ On finite convergence of proximal point algorithms for variational inequalities ⋮ On the gradient-projection method for solving the nonsymmetric linear complementarity problem ⋮ An inertial extrapolation method for convex simple bilevel optimization ⋮ A New Computational Method for the Sparsest Solutions to Systems of Linear Equations ⋮ Perturbation theory for mathematical programming problems ⋮ The adventures of a simple algorithm ⋮ Finite perturbation of convex programs
This page was built for publication: Nonlinear Perturbation of Linear Programs
