Combined phase I—phase II methods of feasible directions
From MaRDI portal
Publication:4194754
DOI10.1007/BF01588225zbMath0407.90076OpenAlexW2012975146MaRDI QIDQ4194754
R. Trahan, Elijah Polak, David Q. Mayne
Publication date: 1979
Published in: Mathematical Programming (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf01588225
Related Items (30)
Optimality conditions and a method of centers for minimax fractional programs with difference of convex functions ⋮ A superlinearly convergent norm-relaxed SQP method of strongly sub-feasible directions for constrained optimization without strict complementarity ⋮ An application-oriented, optimization-based methodology for interactive design of engineering systems† ⋮ A new superlinearly convergent norm-relaxed method of strongly sub-feasible direction for inequality constrained optimization ⋮ A strongly convergent norm-relaxed method of strongly sub-feasible direction for optimization with nonlinear equality and inequality constraints ⋮ A generalized gradient projection method for optimization problems with equality and inequality constraints about arbitrary initial point ⋮ Substitution secant/finite difference method to large sparse minimax problems ⋮ A feasible SQP-GS algorithm for nonconvex, nonsmooth constrained optimization ⋮ A robust secant method for optimization problems with inequality constraints ⋮ A New Superlinearly Convergent Strongly Subfeasible Sequential Quadratic Programming Algorithm for Inequality-Constrained Optimization ⋮ New convergence theorems for a class of feasible directions algorithms ⋮ Regularizing the abstract convex program ⋮ Strongly sub-feasible direction method for constrained optimization problems with nonsmooth objective functions ⋮ Computer-aided design via optimization: A review ⋮ A new \(\varepsilon \)-generalized projection method of strongly sub-feasible directions for inequality constrained optimization ⋮ A generalized quadratic programming-based phase I--phase II method for inequality-constrained optimization ⋮ Superlinearly convergent algorithm for min-max problems ⋮ A new superlinearly convergent algorithm of combining QP subproblem with system of linear equations for nonlinear optimization ⋮ Preface ⋮ Algorithms for a class of computer-aided design problems: A review ⋮ Combined phase I—phase II methods of feasible directions ⋮ Sequential quadratically constrained quadratic programming norm-relaxed algorithm of strongly sub-feasible directions ⋮ A generalization of the norm-relaxed method of feasible directions ⋮ An Adaptive Smoothing Method for Continuous Minimax Problems ⋮ Nondifferentiable optimization algorithm for designing control systems having singular value inequalities ⋮ An infeasible-start framework for convex quadratic optimization, with application to constraint-reduced interior-point and other methods ⋮ A new norm-relaxed method of strongly sub-feasible direction for inequality constrained optimization ⋮ A quadratically convergent algorithm for solving infinite dimensional inequalities ⋮ Enhanced methods for feasible directions for engineering design problems ⋮ On a class fo hybrid methods for smooth constrained optimization
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- An outer approximations algorithm for computer-aided design problems
- Feasible directions algorithms for optimization problems with equality and inequality constraints
- An algorithm for optimization problems with functional inequality constraints
- A Penalty Function Method Converging Directly to a Constrained Optimum
- Combined phase I—phase II methods of feasible directions
- Rate of Convergence of a Class of Methods of Feasible Directions
- On the Convergence of Some Feasible Direction Algorithms for Nonlinear Programming
- On the rate of convergence of certain methods of centers
- Constrained Optimization Using a Nondifferentiable Penalty Function
This page was built for publication: Combined phase I—phase II methods of feasible directions
