On Constraint Dropping Schemes and Optimality Functions for a Class of Outer Approximations Algorithms
From MaRDI portal
Publication:4199844
DOI10.1137/0317034zbMath0412.90059OpenAlexW2013267947MaRDI QIDQ4199844
Elijah Polak, Clóvis C. Gonzaga
Publication date: 1979
Published in: SIAM Journal on Control and Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/0317034
computer aided designnonlinear programmingoptimality functionspenalty function methodsouter approximation algorithmsconstraint dropping schemesPhase I - Phase Ii feasible direction algorithms
Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) Numerical methods based on necessary conditions (49M05)
Related Items
An efficient algorithm for solving semi-infinite inequality problems with box constraints, Mixed \(l_ 1/{\mathcal H}_ \infty\) controllers for SISO discrete time systems, A stochastic algorithm for optimization problems with continua of inequalities, Some outer approximation methods for semi-infinite optimization problems, Method of outer approximations and adaptive approximations for a class of matrix games, Cutting sphere algorithm, An outer-approximation algorithm for a class of mixed-integer nonlinear programs, A robust secant method for optimization problems with inequality constraints, A cutting-plane algorithm with linear and geometric rates of convergence, An implementable algorithm for the optimal design centering, tolerancing, and tuning problem, Computer-aided design via optimization: A review, A recursive quadratic programming algorithm for semi-infinite optimization problems, A cutting-plane method for quadratic semi infinite programming problems, Solving continuous min-max problems by an iterative entropic regularization method., Derivative-free robust optimization by outer approximations, Preface, A direct method of linearization for continuous minimax problems, 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, On the optimal design centering, tolerancing, and tuning problem, On the use of augmented Lagrangians in the solution of generalized semi-infinite min-max problems, Finite-termination schemes for solving semi-infinite satisfycing problems