Pages that link to "Item:Q5541039"

The following pages link to On the Convergence of Some Feasible Direction Algorithms for Nonlinear Programming (Q5541039):

Displaying 50 items.

• Strongly sub-feasible direction method for constrained optimization problems with nonsmooth objective functions (Q439450) (← links)
• Superlinearly convergent norm-relaxed SQP method based on active set identification and new line search for constrained minimax problems (Q481052) (← links)
• A new \(\varepsilon \)-generalized projection method of strongly sub-feasible directions for inequality constrained optimization (Q646746) (← links)
• A constrained optimization reformulation and a feasible descent direction method for \(L_{1/2}\) regularization (Q742307) (← links)
• A discussion of probability functions and constraints from a variational perspective (Q829489) (← links)
• A new superlinearly convergent norm-relaxed method of strongly sub-feasible direction for inequality constrained optimization (Q858741) (← links)
• A strongly convergent norm-relaxed method of strongly sub-feasible direction for optimization with nonlinear equality and inequality constraints (Q861188) (← links)
• On the de-facto convex structure of a least square problem for estimating the term structure of interest rates (Q1000400) (← links)
• Enhanced methods for feasible directions for engineering design problems (Q1068727) (← links)
• An algorithm for linearly constrained nonlinear programming problems (Q1151830) (← links)
• Classes of orderings of measures and related correlation inequalities. II. Multivariate reverse rule distributions (Q1157067) (← links)
• Numerical study of some feasible direction methods in mathematical programming (Q1165559) (← links)
• A generalized quadratic programming-based phase I--phase II method for inequality-constrained optimization (Q1205504) (← links)
• Rates of convergence for a method of centers algorithm (Q1215256) (← links)
• On the rate of convergence of some feasible direction algorithms (Q1221697) (← links)
• A systematic approach to the synthesis of algorithms (Q1224412) (← links)
• A convergence theory for a class of anti-jamming strategies (Q1228553) (← links)
• Sufficient conditions for the convergence of monotonic mathematical programming algorithms (Q1230497) (← links)
• Minimization methods with constraints (Q1234628) (← links)
• The Topkis-Veinott algorithm for solving nonlinear programs with lower and upper bounded variables (Q1259272) (← links)
• Global convergence analysis of algorithms for finding feasible points in norm-relaxed MFD (Q1280097) (← links)
• A generalization of the norm-relaxed method of feasible directions (Q1294211) (← links)
• Norm-relaxed method of feasible directions for solving nonlinear programming problems (Q1338556) (← links)
• Convergence analysis of norm-relaxed method of feasible directions (Q1359453) (← links)
• Self-tuning norm-relaxed method of feasible directions (Q1367804) (← links)
• A new SQP method of feasible directions for nonlinear programming. (Q1415268) (← links)
• An efficient sequential quadratic programming algorithm for nonlinear programming (Q1765487) (← links)
• A feasible interior-point algorithm for nonconvex nonlinear programming (Q1774879) (← links)
• A feasible conjugate direction method to solve linearly constrained minimization problems (Q1843375) (← links)
• Nonwastefulness of interior iterative procedures (Q1844594) (← links)
• Stacking sequence and shape optimization of laminated composite plates via a level-set method (Q2208621) (← links)
• Simple sequential quadratically constrained quadratic programming feasible algorithm with active identification sets for constrained minimax problems (Q2250067) (← links)
• Optimal pricing and ordering in global supply chain management with constraints under random demand (Q2281766) (← links)
• Restricted simplicial decomposition for convex constrained problems (Q2366609) (← links)
• New sequential quadratically-constrained quadratic programming method of feasible directions and its convergence rate (Q2370024) (← links)
• Feasible generalized monotone line search SQP algorithm for nonlinear minimax problems with inequality constraints (Q2372939) (← links)
• A sequential quadratically constrained quadratic programming method of feasible directions (Q2480785) (← links)
• A method of feasible directions using function approximations, with applications to min max problems (Q2558245) (← links)
• A new norm-relaxed method of strongly sub-feasible direction for inequality constrained optimization (Q2572648) (← links)
• Feasible direction method for bilevel programming problem (Q2903143) (← links)
• A New Superlinearly Convergent Strongly Subfeasible Sequential Quadratic Programming Algorithm for Inequality-Constrained Optimization (Q3506289) (← links)
• A two-stage feasible directions algorithm for nonlinear constrained optimization (Q3762086) (← links)
• Lokale konvergenzeigenschaften einer klasse von iterationsverfahren der nichtlinearen optimierung (Q3783854) (← links)
• Quadratically constrained quadratic programming: Some applications and a method for solution (Q3938843) (← links)
• A method to accelerate the rate of convergence of a class of optimization algorithms (Q4123091) (← links)
• Combined phase I—phase II methods of feasible directions (Q4194754) (← links)
• Bilevel Optimization: Reformulation and First Optimality Conditions (Q4557871) (← links)
• Applications of a general convergence theory for outer approximation algorithms (Q4770226) (← links)
• On differentiability properties of player convex generalized Nash equilibrium problems (Q4981861) (← links)
• A new trust region–sequential quadratic programming approach for nonlinear systems based on nonlinear model predictive control (Q5059172) (← links)