Optimal objective function approximation for separable convex quadratic programming
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 Approximation Methods for Nonseparable Convex Optimization
- A two-segment approximation algorithm for separable convex programming with linear constraints
- Successive approximation in separable programming: An improved procedure for convex separable programs
Cites work
- scientific article; zbMATH DE number 3961334 (Why is no real title available?)
- scientific article; zbMATH DE number 3733623 (Why is no real title available?)
- scientific article; zbMATH DE number 3286662 (Why is no real title available?)
- A simplex algorithm for piecewise-linear programming I: Derivation and proof
- A simplex algorithm for piecewise-linear programming. II: Finiteness, feasibility and degeneracy
- A simplex algorithm for piecewise-linear programming. III: Computational analysis and applications
- An algorithm for approximating convex functions by means by first degree splines
- Computational aspects of two-segment separable programming
- Error Analysis for Convex Separable Programs: The Piecewise Linear Approximation and The Bounds on The Optimal Objective Value
- Error analysis for convex separable programs: Bounds on optimal and dual optimal solutions
- Estimate of the maximum error in best polynomial approximations
- Objective function approximations in mathematical programming
- On the Goldstein-Levitin-Polyak gradient projection method
- Sandwich approximation of univariate convex functions with an application to separable convex programming
- Secant approximation methods for convex optimization
- Solving Piecewise-Linear Programs: Experiments with a Simplex Approach
- Solving highly nonlinear convex separable programs using successive approximation
- Successive approximation in separable programming: An improved procedure for convex separable programs
- Two-Segment Separable Programming
Cited in
(10)- A polynomial-time descent method for separable convex optimization problems with linear constraints
- Algorithm and separating method for the optimisation of quadratic functions
- A MILP formulation for generalized geometric programming using piecewise-linear approximations
- Global optimization of separable objective functions on convex polyhedra via piecewise-linear approximation
- An effective linear approximation method for separable programming problems
- Piecewise-Linear Approximation Methods for Nonseparable Convex Optimization
- Identifying the optimal partition in convex quadratic programming
- scientific article; zbMATH DE number 3916036 (Why is no real title available?)
- Quadratic Combinatorial Optimization Using Separable Underestimators
- Positive definite separable quadratic programs for non-convex problems
This page was built for publication: Optimal objective function approximation for separable convex quadratic programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1340073)
