An outer approximations algorithm for computer-aided design problems
From MaRDI portal
Publication:1250031
DOI10.1007/BF00933378zbMath0387.90094MaRDI QIDQ1250031
R. Trahan, David Q. Mayne, Elijah Polak
Publication date: 1979
Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)
Related Items
An efficient algorithm for solving semi-infinite inequality problems with box constraints, A stochastic algorithm for optimization problems with continua of inequalities, Numerical solution of dynamic optimization problems using parametrization and \(\text{Op}^{\text{ti}}\text{A}\) software, An outer-approximation algorithm for a class of mixed-integer nonlinear programs, A robust secant method for optimization problems with inequality constraints, Second-order optimality conditions for a class of nonlinear programming problems, An implementable algorithm for the optimal design centering, tolerancing, and tuning problem, A new solution to optimization-satisfaction problems by a penalty method, Global convergence of a semi-infinite optimization method, Computer-aided design via optimization: A review, A parallel algorithm for semi-infinite programming, Iterative algorithm for robust performance optimization, A smoothing algorithm for finite min-max-min problems, Algorithms for a class of computer-aided design problems: A review, Combined phase I—phase II methods of feasible directions, Nondifferentiable optimization algorithm for designing control systems having singular value inequalities, Use of a Monte Carlo method in an algorithm which solves a set of functional inequalities
Cites Work
- Infinitely constrained optimization problems
- Optimization of design tolerances using nonlinear programming
- A General Theory of Convergence for Constrained Optimization Algorithms that Use Antizigzagging Provisions
- An algorithm for optimization problems with functional inequality constraints
- A nonlinear programming approach to optimal design centering, tolerancing, and tuning
- Rate of Convergence of a Class of Methods of Feasible Directions
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
