Discontinuous piecewise linear optimization
From MaRDI portal
Recommendations
- Global minimization of constrained problems with discontinuous penalty functions
- scientific article; zbMATH DE number 1482995
- scientific article; zbMATH DE number 3952508
- A special ordered set approach for optimizing a discontinuous separable piecewise linear function
- Numerical methods for optimizing discontinuous functions
Cites work
- scientific article; zbMATH DE number 3915531 (Why is no real title available?)
- scientific article; zbMATH DE number 1243473 (Why is no real title available?)
- scientific article; zbMATH DE number 3793774 (Why is no real title available?)
- scientific article; zbMATH DE number 3307153 (Why is no real title available?)
- A Branch-and-Bound Method for the Fixed Charge Transportation Problem
- A Global and Quadratically Convergent Method for Linear $l_\infty $ Problems
- A Globally and Superlinearly Convergent Algorithm for Convex Quadratic Programs with Simple Bbounds
- A New Method for Optimal Truss Topology Design
- A Penalty Function Method Converging Directly to a Constrained Optimum
- A Projected Lagrangian Algorithm for Nonlinear $l_1 $ Optimization
- A SIMPLEX PROCEDURE FOR A FIXED CHARGE PROBLEM
- A Stable Algorithm for Solving the Multifacility Location Problem Involving Euclidean Distances
- A Structure-Exploiting Algorithm for Nonlinear Minimax Problems
- A Technique for Resolving Degeneracy in Linear Programming
- A finite algorithm for concave minimization over a polyhedron
- A globally and quadratically convergent affine scaling method for linear \(l_ 1\) problems
- A model algorithm for composite nondifferentiable optimization problems
- A network penalty method
- A projected newton method forl p norm location problems
- A projection method for the uncapacitated facility location problem
- 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
- A structured computer system model
- A switching regression method using inequality conditions
- A trust region algorithm for nonsmooth optimization
- An Algorithm for Minimax Approximation in the Nonlinear Case
- An Algorithm for the Chebyshev Problem—With an Application to Concave Programming
- An Efficient Newton Barrier Method for Minimizing a Sum of Euclidean Norms
- An algorithm for composite nonsmooth optimization problems
- Censored Discrete Linear $l_1 $ Approximation
- Combined lp and quasi-Newton methods for minimax optimization
- Concise representation of generalised gradients
- Constrained Optimization Using a Nondifferentiable Penalty Function
- Discharge allocation for hydro-electric generating stations
- Discontinuous Optimization by Smoothing
- Discontinuous piecewise linear optimization
- Exact Penalty Functions in Constrained Optimization
- Linearly Constrained Discrete I 1 Problems
- Local properties of algorithms for minimizing nonsmooth composite functions
- Nonlinear programming via an exact penalty function: Asymptotic analysis
- Nonlinear programming via an exact penalty function: Global analysis
- On Cline’s Direct Method for Solving Overdetermined Linear Systems in the $L_\infty $ Sense
- On Minimizing the Special Radius of a Nonsymmetric Matrix Function: Optimality Conditions and Duality Theory
- On the Sum of the Largest Eigenvalues of a Symmetric Matrix
- On the solution of highly degenerate linear programmes
- Optimality conditions and duality theory for minimizing sums of the largest eigenvalues of symmetric matrices
- Optimality conditions for piecewise smooth functions
- Optimization and nonsmooth analysis
- Primal Methods are Better than Dual Methods for Solving Overdetermined Linear Systems in the $l_\infty $ Sense?
- Répartition optimale de la puissance dans une centrale hydraulique à réserve pompée
- The interactive fixed charge linear programming problem
- Variable metric methods for minimizing a class of nondifferentiable functions
Cited in
(21)- Global optimization of bounded factorable functions with discontinuities
- A special ordered set approach for optimizing a discontinuous separable piecewise linear function
- scientific article; zbMATH DE number 4101970 (Why is no real title available?)
- Gradient-only approaches to avoid spurious local minima in unconstrained optimization
- GeneralizedPC1-functions
- Exception sets of intrinsic and piecewise Lipschitz functions
- Discontinuous piecewise linear optimization
- Local smooth representations of parametric semiclosed polyhedra with applications to sensitivity in piecewise linear programs
- The hill detouring method for minimizing hinging hyperplanes functions
- Piecewise-linear functions of several variables; their modelling, local behaviour and extrema
- A conjugate Rosen's gradient projection method with global line search for piecewise linear concave optimization
- A polynomial local optimality condition for the concave piecewise linear network flow problem
- The continuous quadrant penalty formulation of logical constraints
- scientific article; zbMATH DE number 4135727 (Why is no real title available?)
- Mixed integer linear programming formulation techniques
- scientific article; zbMATH DE number 1187201 (Why is no real title available?)
- Exact penalty and optimality condition for nonseparable continuous piecewise linear programming
- Automatic decrease of the penalty parameter in exact penalty function methods
- Mathematical programming formulations for piecewise polynomial functions
- An infeasible-start framework for convex quadratic optimization, with application to constraint-reduced interior-point and other methods
- Hill tunneling method via peak subpoints for continuous piecewise linear programming
This page was built for publication: Discontinuous piecewise linear optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1380942)
