On the Convergence of Some Feasible Direction Algorithms for Nonlinear Programming
From MaRDI portal
Cited in
(54)- On the de-facto convex structure of a least square problem for estimating the term structure of interest rates
- Enhanced methods for feasible directions for engineering design problems
- An algorithm for linearly constrained nonlinear programming problems
- Classes of orderings of measures and related correlation inequalities. II. Multivariate reverse rule distributions
- Numerical study of some feasible direction methods in mathematical programming
- A generalized quadratic programming-based phase I--phase II method for inequality-constrained optimization
- Rates of convergence for a method of centers algorithm
- On the rate of convergence of some feasible direction algorithms
- A systematic approach to the synthesis of algorithms
- A convergence theory for a class of anti-jamming strategies
- Sufficient conditions for the convergence of monotonic mathematical programming algorithms
- Minimization methods with constraints
- The Topkis-Veinott algorithm for solving nonlinear programs with lower and upper bounded variables
- Global convergence analysis of algorithms for finding feasible points in norm-relaxed MFD
- A generalization of the norm-relaxed method of feasible directions
- Norm-relaxed method of feasible directions for solving nonlinear programming problems
- Convergence analysis of norm-relaxed method of feasible directions
- Self-tuning norm-relaxed method of feasible directions
- A new SQP method of feasible directions for nonlinear programming.
- An efficient sequential quadratic programming algorithm for nonlinear programming
- A feasible interior-point algorithm for nonconvex nonlinear programming
- A feasible conjugate direction method to solve linearly constrained minimization problems
- Nonwastefulness of interior iterative procedures
- Stacking sequence and shape optimization of laminated composite plates via a level-set method
- Simple sequential quadratically constrained quadratic programming feasible algorithm with active identification sets for constrained minimax problems
- Optimal pricing and ordering in global supply chain management with constraints under random demand
- Restricted simplicial decomposition for convex constrained problems
- New sequential quadratically-constrained quadratic programming method of feasible directions and its convergence rate
- Feasible generalized monotone line search SQP algorithm for nonlinear minimax problems with inequality constraints
- A sequential quadratically constrained quadratic programming method of feasible directions
- A method of feasible directions using function approximations, with applications to min max problems
- A new norm-relaxed method of strongly sub-feasible direction for inequality constrained optimization
- Feasible direction method for bilevel programming problem
- A New Superlinearly Convergent Strongly Subfeasible Sequential Quadratic Programming Algorithm for Inequality-Constrained Optimization
- A two-stage feasible directions algorithm for nonlinear constrained optimization
- Lokale konvergenzeigenschaften einer klasse von iterationsverfahren der nichtlinearen optimierung
- Quadratically constrained quadratic programming: Some applications and a method for solution
- A method to accelerate the rate of convergence of a class of optimization algorithms
- Combined phase I—phase II methods of feasible directions
- Strongly sub-feasible direction method for constrained optimization problems with nonsmooth objective functions
- Bilevel optimization: reformulation and first optimality conditions
- Applications of a general convergence theory for outer approximation algorithms
- Superlinearly convergent norm-relaxed SQP method based on active set identification and new line search for constrained minimax problems
- On differentiability properties of player convex generalized Nash equilibrium problems
- A new trust region–sequential quadratic programming approach for nonlinear systems based on nonlinear model predictive control
- An active set sequential quadratic programming algorithm for nonlinear optimisation
- On the rate of convergence of certain methods of centers
- A superlinearly convergent method of feasible directions.
- A new -generalized projection method of strongly sub-feasible directions for inequality constrained optimization
- Partially smoothing and gradient-based algorithm for optimizing the VMI system with competitive retailers under random demands
- A constrained optimization reformulation and a feasible descent direction method for \(L_{1/2}\) regularization
- A discussion of probability functions and constraints from a variational perspective
- 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
This page was built for publication: On the Convergence of Some Feasible Direction Algorithms for Nonlinear Programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5541039)