Feasible directions algorithms for optimization problems with equality and inequality constraints
From MaRDI portal
Cites work
- A dual approach to solving nonlinear programming problems by unconstrained optimization
- A new method for the optimization of a nonlinear function subject to nonlinear constraints
- A quadratically convergent primal-dual algorithm with global convergence properties for solving optimization problems with equality constraints
- An algorithm for optimization problems with functional inequality constraints
- Combined Primal-Dual and Penalty Methods for Constrained Minimization
- scientific article; zbMATH DE number 3159112 (Why is no real title available?)
- scientific article; zbMATH DE number 3520162 (Why is no real title available?)
- scientific article; zbMATH DE number 3309655 (Why is no real title available?)
- scientific article; zbMATH DE number 3407464 (Why is no real title available?)
- scientific article; zbMATH DE number 3416582 (Why is no real title available?)
- Multiplier and gradient methods
Cited in
(24)- Optimal fixed rules and simple feedback laws in the design of economic policy
- A note on a globalization of Wilson-type optimization methods
- A stochastic algorithm for optimization problems with continua of inequalities
- New convergence theorems for a class of feasible directions algorithms
- Computer-aided design via optimization: A review
- Feasible direction interior-point technique for nonlinear optimization
- Sequential systems of linear equations algorithm for nonlinear optimization problems with general constraints
- Sequential systems of linear equations algorithm for nonlinear optimization problems -- general constrained problems.
- A generalized gradient projection method for optimization problems with equality and inequality constraints about arbitrary initial point
- A global QP-free algorithm for mathematical programs with complementarity constraints
- An infeasible-start framework for convex quadratic optimization, with application to constraint-reduced interior-point and other methods
- Flattened aggregate function method for nonlinear programming with many complicated constraints
- An improved sequential quadratic programming algorithm for solving general nonlinear programming problems
- Primal-dual interior point QP-free algorithm for nonlinear constrained optimization
- Interior-point \(\ell_2\)-penalty methods for nonlinear programming with strong global convergence properties
- Mathematical programming models and algorithms for engineering design optimization
- A two-stage feasible directions algorithm for nonlinear constrained optimization
- A first order, exact penalty function algorithm for equality constrained optimization problems
- Combined phase I—phase II methods of feasible directions
- A modified SLP algorithm and its global convergence
- A feasible descent SQP algorithm for general constrained optimization without strict complemen\-tar\-ity
- Preface
- Nondifferentiable optimization algorithm for designing control systems having singular value inequalities
- A strongly convergent norm-relaxed method of strongly sub-feasible direction for optimization with nonlinear equality and inequality constraints
This page was built for publication: Feasible directions algorithms for optimization problems with equality and inequality constraints
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4121704)
