On Constraint Dropping Schemes and Optimality Functions for a Class of Outer Approximations Algorithms

DOI10.1137/0317034MaRDI QIDQ4199844zbMATH OpenOpenAlexFDO

Authors Elijah Polak, C. 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

zbMATH Keywords

nonlinear programmingcomputer aided designoptimality functionspenalty function methodsouter approximation algorithmsconstraint dropping schemesPhase I - Phase Ii feasible direction algorithms

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) Numerical methods based on necessary conditions (49M05)

Cited in

(23)

• A stochastic algorithm for optimization problems with continua of inequalities
• A cutting-plane method for quadratic semi infinite programming problems
• Some outer approximation methods for semi-infinite optimization problems
• Computer-aided design via optimization: A review
• A recursive quadratic programming algorithm for semi-infinite optimization problems
• An efficient algorithm for solving semi-infinite inequality problems with box constraints
• Mixed \(l_ 1/{\mathcal H}_ \infty\) controllers for SISO discrete time systems
• Cutting sphere algorithm
• Derivative-free robust optimization by outer approximations
• On the optimal design centering, tolerancing, and tuning problem
• Preface
• On the use of augmented Lagrangians in the solution of generalized semi-infinite min-max problems
• Method of outer approximations and adaptive approximations for a class of matrix games
• Finite-termination schemes for solving semi-infinite satisfycing problems
• A cutting-plane algorithm with linear and geometric rates of convergence
• Implementation of an oracle-structured bundle method for distributed optimization
• Solving continuous min-max problems by an iterative entropic regularization method.
• A robust secant method for optimization problems with inequality constraints
• Use of a Monte Carlo method in an algorithm which solves a set of functional inequalities
• An outer-approximation algorithm for a class of mixed-integer nonlinear programs
• Nondifferentiable optimization algorithm for designing control systems having singular value inequalities
• An implementable algorithm for the optimal design centering, tolerancing, and tuning problem
• A direct method of linearization for continuous minimax problems

This page was built for publication: On Constraint Dropping Schemes and Optimality Functions for a Class of Outer Approximations Algorithms

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4199844)