scholarly journals Sufficient Fritz John optimality conditions for nondifferentiable convex programming

1976 ◽  
Vol 19 (4) ◽  
pp. 462-468 ◽  
Author(s):  
B. D. Craven ◽  
B. Mond
Keyword(s):  
Nonlinear Programming ◽  
Optimality Conditions ◽  
Programming Problem ◽  
Convex Programming ◽  
Necessary Conditions ◽  
Nonlinear Programming Problem ◽  
Necessary Conditions For Optimality ◽  
Ordered Space ◽  
Sufficiency Theorem ◽  
Fritz John Optimality Conditions

AbstractThe Fritz John necessary conditions for optimality of a differentiable nonlinear programming problem have been shown, given additional convexity hypotheses, to be also sufficient (by Gulati, Craven, and others). This sufficiency theorem is now extended to minimization (suitably defined) of a function taking values in a partially ordered space, and to (convex) objective and constraint functions which are not always differentiable. The results are expressed in terms of subgradients.

scholarly journals Trust-Region Based Penalty Barrier Algorithm for Constrained Nonlinear Programming Problems: An Application of Design of Minimum Cost Canal Sections

Mathematics ◽  
2021 ◽  
Vol 9 (13) ◽  
pp. 1551
Author(s):  
Bothina El-Sobky ◽  
Yousria Abo-Elnaga ◽  
Abd Allah A. Mousa ◽  
Mohamed A. El-Shorbagy
Keyword(s):  
Nonlinear Programming ◽  
Global Convergence ◽  
Programming Problem ◽  
Trust Region ◽  
Convergence Theory ◽  
Benchmark Problems ◽  
Nonlinear Programming Problem ◽  
Barrier Method ◽  
Starting Point ◽  
Constrained Nonlinear Programming

In this paper, a penalty method is used together with a barrier method to transform a constrained nonlinear programming problem into an unconstrained nonlinear programming problem. In the proposed approach, Newton’s method is applied to the barrier Karush–Kuhn–Tucker conditions. To ensure global convergence from any starting point, a trust-region globalization strategy is used. A global convergence theory of the penalty–barrier trust-region (PBTR) algorithm is studied under four standard assumptions. The PBTR has new features; it is simpler, has rapid convergerce, and is easy to implement. Numerical simulation was performed on some benchmark problems. The proposed algorithm was implemented to find the optimal design of a canal section for minimum water loss for a triangle cross-section application. The results are promising when compared with well-known algorithms.

Minimax Input Shaper Design Using Linear Programming

2008 ◽  
Vol 130 (5) ◽  
Author(s):  
Tarunraj Singh
Keyword(s):  
Linear Programming ◽  
Nonlinear Programming ◽  
Programming Problem ◽  
Linear Programming Problem ◽  
Barycentric Coordinates ◽  
Nonlinear Programming Problem ◽  
Dome A ◽  
Input Shaper ◽  
Maximum Value ◽  
The Cost

The focus of this paper is on the design of robust input shapers where the maximum value of the cost function over the domain of uncertainty is minimized. This nonlinear programming problem is reformulated as a linear programming problem by approximating a n-dimensional hypersphere with multiple hyperplanes (as in a geodesic dome). A recursive technique to approximate a hypersphere to any level of accuracy is developed using barycentric coordinates. The proposed technique is illustrated on the spring-mass-dashpot and the benchmark floating oscillator problem undergoing a rest-to-rest maneuver. It is shown that the results of the linear programming problem are nearly identical to that of the nonlinear programming problem.

A numerical approach for time-optimal path-planning of kinematically redundant manipulators

Robotica ◽  
1994 ◽  
Vol 12 (5) ◽  
pp. 401-410 ◽  
Author(s):  
Chia-Ju Wu
Keyword(s):  
Nonlinear Programming ◽  
Path Planning ◽  
Programming Problem ◽  
Optimal Path ◽  
Numerical Approach ◽  
Redundant Manipulators ◽  
Nonlinear Programming Problem ◽  
Optimal Path Planning ◽  
Time Optimal ◽  
Feasible Solutions

SUMMARYIn this paper, a numerical approach is proposed to solve the time-optimal path-planning (TOPP) problem of kinematically redundant manipulators between two end-points. The first step is to transform the TOPP problem into a nonlinear programming problem by an iterative procedure. Then an approach to find the initial feasible solutions of the problem is proposed. Since initial feasible solutions can be found easily, the optimization process of the nonlinear programming problem can be started from different points to find the global minimum. A planar three-link robotic manipulator is used to illustrate the validity of the proposed approach.

Sign in / Sign up

Export Citation Format

Share Document