A Nondifferentiable Optimization Algorithm for Constrained Minimax Linkage Function Generation

[+] Author and Article Information
K. Kurien Issac

Department of Mechanical Engineering, Indian Institute of Technology—Bombay, Bombay 400 076 India

J. Mech. Des 115(4), 978-987 (Dec 01, 1993) (10 pages) doi:10.1115/1.2919296 History: Received September 01, 1989; Revised September 01, 1991; Online June 02, 2008


This paper describes a nondifferentiable optimization (NDO) algorithm for solving constrained minimax linkage synthesis. Use of a proper characterization of minima makes the algorithm superior to the smooth optimization algorithms for minimax linkage synthesis and the concept of following the curved ravines of the objective function makes it very effective. The results obtained are superior to some of the reported solutions and demonstrate the algorithm’s ability to consistently arrive at actual minima from widely separated starting points. The results indicate that Chebyshev’s characterization is not a necessary condition for minimax linkages, while the characterization used in the algorithm is a proper necessary condition.

Copyright © 1993 by The American Society of Mechanical Engineers
Your Session has timed out. Please sign back in to continue.





Some tools below are only available to our subscribers or users with an online account.

Related Content

Customize your page view by dragging and repositioning the boxes below.

Related Journal Articles
Related eBook Content
Topic Collections

Sorry! You do not have access to this content. For assistance or to subscribe, please contact us:

  • TELEPHONE: 1-800-843-2763 (Toll-free in the USA)
  • EMAIL: asmedigitalcollection@asme.org
Sign In