Piecewise linear methods for nonlinear equations and optimization
algorithmscomputer graphicseconomic equilibriafixed pointslinear complementarity problemsnonlinear equationsnonlinear optimizationpiecewise linear methods
Numerical computation of solutions to systems of equations (65H10) Global methods, including homotopy approaches to the numerical solution of nonlinear equations (65H20) Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33) Interior-point methods (90C51)
Piecewise linear methods had their beginning in the mid-1960s with \textit{C. E. Lemke's} algorithm for calculating solutions to linear complementarity problems [cf. Nonlinear Programming, Proc. Sympos. Math. Res. Center, Univ. Wisconsin, Madison 1970, 349--384 (1970; Zbl 0227.90043)]. In the 1970s and 1980s activity moved on to computing fixed points of rather general maps and economic equilibria. More recently, they have been used to approximate implicitly defined manifolds, with applications being made to computer graphics and approximations of integrals over implicitly defined manifolds. In this paper the authors present the basic ideas of piecewise linear algorithms and a selection of applications. Further references to the literature on piecewise linear algorithms are indicated.
- Piecewise-linearized methods for initial-value problems
- Piecewise linear approximations in nonconvex nonsmooth optimization
- Piecewise-Linear Approximation Methods for Nonseparable Convex Optimization
- Piecewise linear approximation of nonlinear ordinary differential equations
- Partial linearization methods in nonlinear programming
- scientific article; zbMATH DE number 7038944
- Piecewise-linearized methods for single degree-of-freedom problems
- Piecewise-linearized and linearized \(\vartheta\)-methods for ordinary and partial differential equations.
- A nonconvex, piecewise linear optimization problem
- An algorithm for nonsmooth optimization by successive piecewise linearization
- A course in triangulations for solving equations with deformations
- A simplicial approach to the determination of an integer point of a simplex
- A unified approach to interior point algorithms for linear complementarity problems: A summary
- An Algorithm for Piecewise Linear Approximation of Implicitly Defined Two-Dimensional Surfaces
- An Algorithm for Piecewise-Linear Approximation of an Implicitly Defined Manifold
- Approximation of Integrals for Boundary Element Methods
- Bimatrix Equilibrium Points and Mathematical Programming
- Discrete groups generated by reflections
- Efficient Acceleration Techniques for Fixed Point Algorithms
- Equilibrium Points of Bimatrix Games
- Existence and Approximation of Robust Solutions of Variational Inequality Problems over Polytopes
- Homotopies for computation of fixed points
- Homotopies for computation of fixed points on unbounded regions
- scientific article; zbMATH DE number 3177183 (Why is no real title available?)
- scientific article; zbMATH DE number 47206 (Why is no real title available?)
- scientific article; zbMATH DE number 53115 (Why is no real title available?)
- scientific article; zbMATH DE number 3487169 (Why is no real title available?)
- scientific article; zbMATH DE number 3535189 (Why is no real title available?)
- scientific article; zbMATH DE number 3562788 (Why is no real title available?)
- scientific article; zbMATH DE number 1232476 (Why is no real title available?)
- scientific article; zbMATH DE number 729680 (Why is no real title available?)
- scientific article; zbMATH DE number 964349 (Why is no real title available?)
- scientific article; zbMATH DE number 3193312 (Why is no real title available?)
- Intersection theorems with a continuum of intersection points
- On the Computation of Manifolds of Foldpoints for Parameter-Dependent Problems
- On the computation of multi-dimensional solution manifolds of parametrized equations
- Optimality and Degeneracy in Linear Programming
- Piecewise-Linear Homotopy Algorithms for Sparse Systems of Nonlinear Equations
- Simplizialzerlegungen von beschränkter Flachheit
- The Approximation of Fixed Points of a Continuous Mapping
- The computation of fixed points and applications
- Triangulations and simplicial methods
- Volume integrals for boundary element methods
- Partial linearization methods in nonlinear programming
- Numerical continuation methods: a perspective
- On the complexity of an expanded Tarski's fixed point problem under the componentwise ordering
- Geometric optimal control and applications to aerospace
- A mixed 0-1 linear programming approach to the computation of all pure-strategy Nash equilibria of a finite \(n\)-person game in normal form
- Piecewise linear bounding of univariate nonlinear functions and resulting mixed integer linear programming-based solution methods
- On the use of piecewise linear models in nonlinear programming
- An effective logarithmic formulation for piecewise linearization requiring no inequality constraint
- Estimating shape parameters of piecewise linear-quadratic problems
- Whitney's theorem, triangular sets, and probabilistic descent on manifolds
- \texttt{PAINT-SICon}: constructing consistent parametric representations of Pareto sets in nonconvex multiobjective optimization
- Piecewise linear regularized solution paths
- An implementation of the piecewise-linear homotopy algorithm for the computation of fixed points
- scientific article; zbMATH DE number 4192964 (Why is no real title available?)
- scientific article; zbMATH DE number 3862334 (Why is no real title available?)
- Piecewise Linear Function Fitting via Mixed-Integer Linear Programming
- Global search perspectives for multiobjective optimization
- Piecewise linear approximation of smooth compact fibers
This page was built for publication: Piecewise linear methods for nonlinear equations and optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1593829)
