Piecewise-Linear Approximation Methods for Nonseparable Convex Optimization
From MaRDI portal
Recommendations
- Global optimization of separable objective functions on convex polyhedra via piecewise-linear approximation
- scientific article; zbMATH DE number 3916036
- Piecewise linear approximations in nonconvex nonsmooth optimization
- Optimal objective function approximation for separable convex quadratic programming
- A two-segment approximation algorithm for separable convex programming with linear constraints
Cited in
(26)- An effective linear approximation method for separable programming problems
- Decomposition algorithm for convex differentiable minimization
- A unified description of iterative algorithms for traffic equilibria
- Optimal objective function approximation for separable convex quadratic programming
- Piecewise linear methods for nonlinear equations and optimization
- Piecewise linear bounding of univariate nonlinear functions and resulting mixed integer linear programming-based solution methods
- A geometric approach to global optimization
- Piecewise-convex maximization problems: algorithm and computational experiments
- Piecewise linear approximation by the method of worst segment division
- Piecewise linear bounding functions in univariate global optimization
- Further applications of a splitting algorithm to decomposition in variational inequalities and convex programming
- Global optimization of separable objective functions on convex polyhedra via piecewise-linear approximation
- Linearly constrained global optimization via piecewise-linear approximation
- A nonconvex, piecewise linear optimization problem
- A class of globally convergent optimization methods based on conservative convex separable approximations
- Practical piecewise-linear approximation for monotropic optimization
- A unifying polyhedral approximation framework for convex optimization
- Piecewise Linear Function Fitting via Mixed-Integer Linear Programming
- scientific article; zbMATH DE number 3916036 (Why is no real title available?)
- scientific article; zbMATH DE number 1292040 (Why is no real title available?)
- A piecewise linear approximation procedure forLpnorm curve fitting
- A Comparison of Two Mixed-Integer Linear Programs for Piecewise Linear Function Fitting
- On multiobjective combinatorial optimization and dynamic interim hedging of efficient portfolios
- Convex separable optimization is not much harder than linear optimization
- An alternating direction method of multipliers for solving user equilibrium problem
- Tractable approximate robust geometric programming
This page was built for publication: Piecewise-Linear Approximation Methods for Nonseparable Convex Optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3793946)
