Pages that link to "Item:Q3690591"

The following pages link to A projected lagrangian algorithm for semi-infinite programming (Q3690591):

Displaying 38 items.

• Solving semi-infinite programs by smoothing projected gradient method (Q480937) (← links)
• A relaxation method for solving systems with infinitely many linear inequalities (Q691462) (← links)
• An exact penalty function algorithm for semi-infinite programmes (Q751775) (← links)
• Saddle points theory of two classes of augmented Lagrangians and its applications to generalized semi-infinite programming (Q836067) (← links)
• A one-phase algorithm for semi-infinite linear programming (Q911454) (← links)
• Global convergence of a semi-infinite optimization method (Q912572) (← links)
• A parallel algorithm for semi-infinite programming (Q956770) (← links)
• A new smoothing Newton-type algorithm for semi-infinite programming (Q969747) (← links)
• A smoothing projected Newton-type algorithm for semi-infinite programming (Q1001204) (← links)
• An interior semi-infinite programming method (Q1093544) (← links)
• A comparative study of several semi-infinite nonlinear programming algorithms (Q1102202) (← links)
• A barrier function method for minimax problems (Q1186276) (← links)
• A purification algorithm for semi-infinite programming (Q1197680) (← links)
• A globally convergent SQP method for semi-infinite nonlinear optimization (Q1262218) (← links)
• A multi-local optimization algorithm (Q1265238) (← links)
• New descent rules for solving the linear semi-infinite programming problem (Q1332958) (← links)
• A smoothing Newton method for semi-infinite programming (Q1777435) (← links)
• Global solution of semi-infinite programs (Q1780954) (← links)
• Numerical experiments in semi-infinite programming (Q1816403) (← links)
• An extension of the simplex algorithm for semi-infinite linear programming (Q1824547) (← links)
• A review of reliable maximum likelihood algorithms for semiparametric mixture models (Q1901749) (← links)
• A logarithmic barrier cutting plane method for convex programming (Q1904709) (← links)
• Relaxation methods for solving linear inequality systems: converging results (Q1939079) (← links)
• On the numerical treatment of linearly constrained semi-infinite optimization problems (Q1969893) (← links)
• Suggested research topics in sensitivity and stability analysis for semi- infinite programming problems (Q2276890) (← links)
• Global convergence of a robust smoothing SQP method for semi-infinite programming (Q2370033) (← links)
• A homotopy interior point method for semi-infinite programming problems (Q2385505) (← links)
• The constrained Fisher scoring method for maximum likelihood computation of a nonparametric mixing distribution (Q2430223) (← links)
• A nonlinear norm-relaxed method for finely discretized semi-infinite optimization problems (Q2435607) (← links)
• A norm-relaxed method of feasible directions for finely discretized problems from semi-infinite programming (Q2462105) (← links)
• Interior point filter method for semi-infinite programming problems (Q3111139) (← links)
• Rate of convergence of a class of numerical methods solving linear inequality systems (Q3112495) (← links)
• An iterative method for solving KKT system of the semi-infinite programming (Q3369516) (← links)
• A reduction method for semi-infinite programming by means of a global stochastic approach† (Q3391897) (← links)
• An exact penalty function for semi-infinite programming (Q3762085) (← links)
• Logarithmic Barrier Decomposition Methods for Semi-infinite Programming (Q3842985) (← links)
• Convergent Algorithms for a Class of Convex Semi-infinite Programs (Q5043283) (← links)
• On Fast Computation of the Non-Parametric Maximum Likelihood Estimate of a Mixing Distribution (Q5422024) (← links)