Discontinuous piecewise linear optimization
From MaRDI portal
Publication:1380942
DOI10.1007/BF01581171zbMath0901.90163OpenAlexW2061367845MaRDI QIDQ1380942
Andrew R. Conn, Marcel Mongeau
Publication date: 11 March 1998
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf01581171
odnondifferentiable optimizationdegeneracypenalty approachprojected gradientdescent algorithmridgesactive-setpiecewise-linear programmingdiscontinuous optimizationdiscontinuous piecewise linear optimizationexact penalty meth
Related Items
A polynomial local optimality condition for the concave piecewise linear network flow problem, Discontinuous piecewise linear optimization, A conjugate Rosen's gradient projection method with global line search for piecewise linear concave optimization, Mathematical programming formulations for piecewise polynomial functions, Automatic decrease of the penalty parameter in exact penalty function methods, Gradient-only approaches to avoid spurious local minima in unconstrained optimization, Exact penalty and optimality condition for nonseparable continuous piecewise linear programming, The continuous quadrant penalty formulation of logical constraints, Local smooth representations of parametric semiclosed polyhedra with applications to sensitivity in piecewise linear programs, Global optimization of bounded factorable functions with discontinuities, The hill detouring method for minimizing hinging hyperplanes functions, GeneralizedPC1-functions, Mixed Integer Linear Programming Formulation Techniques, An infeasible-start framework for convex quadratic optimization, with application to constraint-reduced interior-point and other methods, Exception sets of intrinsic and piecewise Lipschitz functions
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A projection method for the uncapacitated facility location problem
- An algorithm for composite nonsmooth optimization problems
- On the solution of highly degenerate linear programmes
- A simplex algorithm for piecewise-linear programming. II: Finiteness, feasibility and degeneracy
- A switching regression method using inequality conditions
- A network penalty method
- A simplex algorithm for piecewise-linear programming. III: Computational analysis and applications
- A globally and quadratically convergent affine scaling method for linear \(l_ 1\) problems
- A structured computer system model
- Optimality conditions and duality theory for minimizing sums of the largest eigenvalues of symmetric matrices
- Discharge allocation for hydro-electric generating stations
- A trust region algorithm for nonsmooth optimization
- Discontinuous piecewise linear optimization
- Local properties of algorithms for minimizing nonsmooth composite functions
- A simplex algorithm for piecewise-linear programming I: Derivation and proof
- Optimization and nonsmooth analysis
- A finite algorithm for concave minimization over a polyhedron
- Répartition optimale de la puissance dans une centrale hydraulique à réserve pompée
- Concise representation of generalised gradients
- The interactive fixed charge linear programming problem
- Censored Discrete Linear $l_1 $ Approximation
- A projected newton method forl p norm location problems
- Primal Methods are Better than Dual Methods for Solving Overdetermined Linear Systems in the $l_\infty $ Sense?
- A SIMPLEX PROCEDURE FOR A FIXED CHARGE PROBLEM
- Variable metric methods for minimizing a class of nondifferentiable functions
- Combined lp and quasi-Newton methods for minimax optimization
- Linearly Constrained Discrete I 1 Problems
- A Projected Lagrangian Algorithm for Nonlinear $l_1 $ Optimization
- A Stable Algorithm for Solving the Multifacility Location Problem Involving Euclidean Distances
- Optimality conditions for piecewise smooth functions
- A model algorithm for composite nondifferentiable optimization problems
- Discontinuous Optimization by Smoothing
- Nonlinear programming via an exact penalty function: Global analysis
- Nonlinear programming via an exact penalty function: Asymptotic analysis
- On the Sum of the Largest Eigenvalues of a Symmetric Matrix
- A Structure-Exploiting Algorithm for Nonlinear Minimax Problems
- A Global and Quadratically Convergent Method for Linear $l_\infty $ Problems
- A Penalty Function Method Converging Directly to a Constrained Optimum
- On Cline’s Direct Method for Solving Overdetermined Linear Systems in the $L_\infty $ Sense
- Exact Penalty Functions in Constrained Optimization
- On Minimizing the Special Radius of a Nonsymmetric Matrix Function: Optimality Conditions and Duality Theory
- An Efficient Newton Barrier Method for Minimizing a Sum of Euclidean Norms
- A Globally and Superlinearly Convergent Algorithm for Convex Quadratic Programs with Simple Bbounds
- A New Method for Optimal Truss Topology Design
- A Technique for Resolving Degeneracy in Linear Programming
- An Algorithm for Minimax Approximation in the Nonlinear Case
- An Algorithm for the Chebyshev Problem—With an Application to Concave Programming
- Constrained Optimization Using a Nondifferentiable Penalty Function
- A Branch-and-Bound Method for the Fixed Charge Transportation Problem
