Pages that link to "Item:Q5585897"
From MaRDI portal
The following pages link to Convergence Conditions for Nonlinear Programming Algorithms (Q5585897):
Displaying 50 items.
- Isosystolic inequalities for optical hypersurfaces (Q305748) (← links)
- Alternating projections on nontangential manifolds (Q387545) (← links)
- Necessary and sufficient optimality conditions for mathematical programs with equilibrium constraints (Q555857) (← links)
- Remarks on the convergence of Rosen's gradient projection method (Q578857) (← links)
- Discussion on the convergence of Rosen's gradient projection method (Q578858) (← links)
- Horizontal mixed decomposition (Q581228) (← links)
- A block coordinate variable metric forward-backward algorithm (Q727391) (← links)
- Modelling considerations in optimal design of reinforced structures (Q759553) (← links)
- On the convergence of a class of outer approximation algorithms for convex programs (Q789154) (← links)
- A decision process over variables and their number: Two-phase optimality conditions (Q792227) (← links)
- Steepest ascent algorithms for nonconical multiple objective programming (Q795749) (← links)
- A constrained optimization approach to solving certain systems of convex equations (Q853007) (← links)
- Minimax estimation for singular linear multivariate models with mixed uncertainty (Q860340) (← links)
- A combinatorial approximation algorithm for supply chain network flow problem (Q884620) (← links)
- Global asymptotic stability of non-linear difference equations (Q899884) (← links)
- Canonical bases in linear programming (Q908850) (← links)
- The linearized version of an algorithm for the mixed norms problem (Q912569) (← links)
- On the convergence of nonstationary algorithms modeled by point-to-set maps (Q918142) (← links)
- A network model of migration equilibrium with movement costs (Q919979) (← links)
- Penalty function methods and a duality gap for invex optimization problems (Q923993) (← links)
- A fast polynomial time algorithm for logistics network flows (Q924394) (← links)
- A unified approach to the feasible direction methods for nonlinear programming with linear constraints (Q1058461) (← links)
- Applications of fuzzy set theory to mathematical programming (Q1066822) (← links)
- Extensions of Radstrom's lemma with application to stability theory of mathematical programming (Q1078809) (← links)
- A computable convex programming characterization of optimal interpolatory quadratic splines with free knots (Q1079925) (← links)
- Local convergence of the fuzzy c-means algorithms (Q1091715) (← links)
- Combinatorial behavior of extreme points of perturbed polyhedra (Q1097175) (← links)
- Approximate conversion of spline curves (Q1103319) (← links)
- Convergence of relaxation algorithms by averaging (Q1105492) (← links)
- A stochastic approximation counterpart of the feasible direction method (Q1107247) (← links)
- A shadow price in integer programming for management decision (Q1107446) (← links)
- On the convergence of reference point methods in multiobjective programming (Q1111945) (← links)
- Interval Newton methods and perturbed problems (Q1113619) (← links)
- An algorithm for Ramsey pricing by multiproduct public firms under incomplete information (Q1119146) (← links)
- Using weighting vectors to solve multiple attribute problems: A framework (Q1119480) (← links)
- Lagrangian dual ascent by generalized linear programming (Q1123118) (← links)
- Asymptotic theory for analyzing dose-response survival data with application to the low-dose extrapolation problem (Q1138876) (← links)
- Generalized Kuhn-Tucker conditions and duality for continuous nonlinear programming problems (Q1141356) (← links)
- Nonlinear programming with cumulatively bounded variables (Q1143757) (← links)
- Optimality conditions and duality in continuous programming. I: Convex programs and a theorem of the alternative (Q1145638) (← links)
- Optimal cargo allocation on board a plane: A sequential linear programming approach (Q1152850) (← links)
- On the convergence of a class of nonlinear approximation methods (Q1169786) (← links)
- Using efficient feasible directions in interactive multiple objective linear programming (Q1178731) (← links)
- A method for approximating the solution set of a system of convex inequalities by polytopes (Q1182665) (← links)
- Approximation in multiobjective optimization (Q1187837) (← links)
- The multi-dimensional von Neumann alternating direction search algorithm in \(C(B)\) and \(L_1\) (Q1188107) (← links)
- A distribution multi-echelon lot-size model (Q1197960) (← links)
- An algorithm for linearly constrained programs with a partly linear objective function (Q1200847) (← links)
- On subsidiary problems in geometric programming (Q1206603) (← links)
- Algorithm model for penalty functions-type iterative pcedures (Q1214742) (← links)
