Minimal realization in the max algebra is an extended linear complementarity problem
Systems & Control Letters
The extended linear complementarity problem
Mathematical Programming: Series A and B
Minimal (max,+) Realization of Convex Sequences
SIAM Journal on Control and Optimization
ICCAD '92 Proceedings of the 1992 IEEE/ACM international conference on Computer-aided design
Fast Algorithm for the Cutting Angle Method of Global Optimization
Journal of Global Optimization
An Algorithm for Exact Bounds on the Time Separation of Events in Concurrent Systems
IEEE Transactions on Computers
Conditions for the structural existence of an eigenvalue of a bipartite (min, max, +)-system
Theoretical Computer Science
Cutting Angle Method and a Local Search
Journal of Global Optimization
Generalized Convex Disjunctive Programming: Nonlinear Convex Hull Relaxation
Computational Optimization and Applications
Introduction to Discrete Event Systems
Introduction to Discrete Event Systems
Introduction to Global Optimization (Nonconvex Optimization and Its Applications)
Introduction to Global Optimization (Nonconvex Optimization and Its Applications)
Timing analysis of asynchronous systems using time separation of events
IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
On the equivalence of linear complementarity problems
Operations Research Letters
Anticipating synchronization through optimal feedback control
Journal of Global Optimization
Generalized projections onto convex sets
Journal of Global Optimization
Hi-index | 0.00 |
A variety of problems in computer science, operations research, control theory, etc., can be modeled as non-linear and non-differentiable max---min systems. This paper introduces the global optimization into such systems. The criteria for the existence and uniqueness of the globally optimal solutions are established using the high matrix, optimal max-only projection set and k s -control vector of max---min functions. It is also shown that the global optimization can be accomplished through the partial max-only projection representation with algebraic and combinatorial features. The methods are constructive and lead to an algorithm of finding all globally optimal solutions.