The following pages link to Optimization (Q2709443):
Displaying 50 items.
- Secant algorithms with nonmonotone trust region that employs fletcher penalty function for constrained optimization (Q2767580) (← links)
- ε–Optimality to approximation in partially ordered spaces (Q2785384) (← links)
- <i>ε</i>Variational inequalities for vector approximation problems (Q2785385) (← links)
- Multiplier rules for weak pareto optimization problems (Q2785386) (← links)
- Optimizing of sums and products of linear fractional functions under linear constraints (Q2785387) (← links)
- Subadditive duality in multiobjective integer linear programming (Q2785389) (← links)
- Relation betwen integer linear vector optimization and multicriteria problems on groups and graphs (Q2785391) (← links)
- On matroids with multiple objectives (Q2785392) (← links)
- The bellman equation for vector-valued semi-markovian dyanmic programiing (Q2785393) (← links)
- Lagrange multipliers saddle points and scalarizations in composite multiobjective nonsmooth programming (Q2785394) (← links)
- Multi-directional parallel algorithms for unconstrained optimization (Q2785395) (← links)
- Optimal stopping in a shock model (Q2785396) (← links)
- A Push/Relabel framework for submodular flows and its definement for 0-1 submodular flows (Q2785397) (← links)
- Pdm time cost trade-off:activities are splittable or non-splittable (Q2785398) (← links)
- On a distributed implementation of a decomposition method for multistage linear stochastic programs (Q2785399) (← links)
- Duality for minmax programming involving nonsmooth v-invex functions (Q2785400) (← links)
- On sufficiency and duality for generalised quasicnvex nonsmooth programs (Q2785401) (← links)
- An approach to vector subdifferentials (Q2785402) (← links)
- Local wellposedness of constrained problems (Q2785403) (← links)
- Incentive strategies with threats in dynamic constrained-stackelberg problems. a bilevel programming approach (Q2785404) (← links)
- Notes on a new compromisw value: the<sub>x</sub>-value<sup>†</sup> (Q2785405) (← links)
- Shortest and longest path problems (Q2785406) (← links)
- Stable generalization of convex functions (Q2785407) (← links)
- A Note on roughly convex functions (Q2785409) (← links)
- Favard’s ‘fonction penetrante’ —a roughly convex function (Q2785410) (← links)
- A Pointwise maximum principle in optimal control with multiple integrals<sup>*</sup><sup>*</sup>Dedicated to the 65th birthday of Prof. Dr. R. Klötzler$ef: (Q2785411) (← links)
- Motorway junctions as steiner points in a density field and generalizations (Q2785414) (← links)
- Sensitivity of the gittins index in the contiuous time two-armed bandit problem (Q2785416) (← links)
- One class of separable optimization problems: solution method, application (Q2786312) (← links)
- Convex relaxation and Lagrangian decomposition for indefinite integer quadratic programming (Q2786313) (← links)
- The constrained equal loss rule in problems with constraints and claims (Q2786314) (← links)
- Lipschitz continuity of the gradient of a one-parametric class of SOC merit functions (Q2786315) (← links)
- Properties of ε-value functions for a two person differential game (Q2786316) (← links)
- Cournot and Stackelberg equilibrium in mixed duopoly models (Q2786317) (← links)
- Approximation of an optimal control problem governed by a differential parabolic inclusion (Q2786318) (← links)
- Optimality conditions for non-smooth semi-infinite programming (Q2786319) (← links)
- A compact formulation of a mixed-integer set (Q2786320) (← links)
- Solution sensitivity for Karush–Kuhn–Tucker systems with non-unique Lagrange multipliers (Q2786321) (← links)
- A proximal point algorithm with a ϕ-divergence for quasiconvex programming (Q2786322) (← links)
- Simultaneous metric projection onto closed sets (Q2786323) (← links)
- Strong convergence theorems for maximal monotone operators in Banach spaces (Q2786324) (← links)
- Lower convergence of approximate solutions to vector quasi-variational problems (Q2786325) (← links)
- Lipschitz stability for elliptic optimal control problems with mixed control-state constraints (Q2786327) (← links)
- Dual support method for solving convex quadratic programs (Q2786329) (← links)
- A new iterative algorithm for the variational inequality problem over the fixed point set of a firmly nonexpansive mapping (Q2786330) (← links)
- Solvability and convergence of iterative algorithms for certain functional equations arising in dynamic programming (Q2786331) (← links)
- Theoretical approach for the calculation of a feasible point of the special non-convex set described by a polyhedron and a quadratic function (Q2786333) (← links)
- Convergence analysis of a hybrid Mann iterative scheme with perturbed mapping for variational inequalities and fixed point problems (Q2786334) (← links)
- Adaptive limited memory bundle method for bound constrained large-scale nonsmooth optimization (Q2786335) (← links)
- A theoretical comparison between the simplex method and the basic line search algorithm (Q2790864) (← links)
