Finding normal solutions in piecewise linear programming

DOI10.1007/BF01187901zbMATH Open0838.90094OpenAlexW2080180802MaRDI QIDQ1900115FDOQ1900115

Krzysztof C. Kiwiel

Publication date: 30 May 1996

Published in: Applied Mathematics and Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01187901

Recommendations

• Search for normal solutions in linear programming problems
• Normal solutions of linear programs
• scientific article; zbMATH DE number 5811179
• Solving piecewise linear systems in ABS-normal form
• Piecewise-linear pathways to the optimal solution set in linear programming
• scientific article; zbMATH DE number 1131737
• An algorithm for finding normal solutions of consistent systems of linear equations
• Solving Piecewise-Linear Programs: Experiments with a Simplex Approach
• Résolution de programmes linéaires entiers ou mixtes à l'aide de la forme normale de Hermite
• Piecewise linear programming via interior points

zbMATH Keywords

sensitivity analysisLagrange multipliernondifferentiable optimizationactive set methodconvex polyhedral function

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Quadratic programming (90C20) Convex programming (90C25) Sensitivity, stability, well-posedness (49K40)

Cites Work

• The Simplex Method for Quadratic Programming
• A Parametric Method for Semidefinite Quadratic Programs
• Title not available (Why is that?)
• Convex Analysis
• Proximal level bundle methods for convex nondifferentiable optimization, saddle-point problems and variational inequalities
• Title not available (Why is that?)
• Proximity control in bundle methods for convex nondifferentiable minimization
• Resolving degeneracy in quadratic programming
• New variants of bundle methods
• Title not available (Why is that?)
• Introduction to sensitivity and stability analysis in nonlinear programming
• Title not available (Why is that?)
• The generalized simplex method for minimizing a linear form under linear inequality restraints
• Inertia-Controlling Methods for General Quadratic Programming
• A method for solving nonlinear maximum‐problems depending on parameters
• Automatic decrease of the penalty parameter in exact penalty function methods
• On the solution of highly degenerate linear programmes
• A Cholesky dual method for proximal piecewise linear programming
• A Method for Solving Certain Quadratic Programming Problems Arising in Nonsmooth Optimization
• Nonlinear Perturbation of Linear Programs
• Solution point differentiability without strict complementarity in nonlinear programming
• Finite perturbation of convex programs
• A Technique for Resolving Degeneracy in Linear Programming
• A Dual Method for Certain Positive Semidefinite Quadratic Programming Problems
• Equivalence of some quadratic programming algorithms
• Iterative Solution of Linear Programs
• A new result in the theory and computation of the least-norm solution of a linear program
• Error bounds for strongly convex programs and (super)linearly convergent iterative schemes for the least 2-norm solution of linear programs
• Normal solutions of linear programs
• Global and superlinear convergence of a class of variable metric methods
• Stability of solutions to convex problems of optimization
• A finite algorithm for the least two-norm solution of a linear program¹
• One way to solve the parametric quadratic programming problem
• A Descent Algorithm for Minimizing Polyhedral Convex Functions

Cited In (7)

• Title not available (Why is that?)
• Iterative schemes for the least 2-norm solution of piecewise linear programs
• Proximal level bundle methods for convex nondifferentiable optimization, saddle-point problems and variational inequalities
• On level regularization with normal solutions in decomposition methods for multistage stochastic programming problems
• Tuning strategy for the proximity parameter in convex minimization
• Normal solutions of linear programs
• An inexact bundle variant suited to column generation

This page was built for publication: Finding normal solutions in piecewise linear programming

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1900115)