The following pages link to (Q3141900):
Displayed 50 items.
- On the Behrens-Fisher problem: a globally convergent algorithm and a finite-sample study of the Wald, LR and LM tests (Q955145) (← links)
- On constraint qualifications in nonlinear programming (Q955633) (← links)
- Separation of sets and Wolfe duality (Q956599) (← links)
- A bundle method for solving equilibrium problems (Q959957) (← links)
- \(\varepsilon \)-duality theorems for convex semidefinite optimization problems with conic constraints (Q962489) (← links)
- Generalized \(\varepsilon \)-quasi-solutions in multiobjective optimization problems: existence results and optimality conditions (Q965046) (← links)
- An approximate decomposition algorithm for convex minimization (Q966076) (← links)
- A parallel interior point decomposition algorithm for block angular semidefinite programs (Q969720) (← links)
- Characterizing robust set containments and solutions of uncertain linear programs without qualifications (Q974991) (← links)
- Non-convex quadratic minimization problems with quadratic constraints: global optimality conditions (Q985310) (← links)
- Optimization of R\&D project portfolios under endogenous uncertainty (Q992625) (← links)
- Finding positive matrices subject to linear restrictions (Q996327) (← links)
- On boundedness of (quasi-)convex integer optimization problems (Q999128) (← links)
- Convergent Lagrangian and domain cut method for nonlinear knapsack problems (Q1001200) (← links)
- Generalized Nash equilibrium problem, variational inequality and quasiconvexity (Q1003496) (← links)
- First-order optimality conditions for two classes of generalized nonsmooth semi-infinite optimization (Q1004831) (← links)
- Convex ordered median problem with \(\ell _p\)-norms (Q1013404) (← links)
- A geometric characterization of ``optimality-equivalent'' relaxations (Q1016070) (← links)
- An inexact bundle variant suited to column generation (Q1016116) (← links)
- Hybrid conjugate gradient method for a convex optimization problem over the fixed-point set of a nonexpansive mapping (Q1016416) (← links)
- Adjustment of an affine contract with a fixed-point iteration (Q1016421) (← links)
- On the choice of explicit stabilizing terms in column generation (Q1025985) (← links)
- \(\varepsilon \)-optimality and \(\varepsilon \)-Lagrangian duality for a nonconvex programming problem with an infinite number of constraints (Q1028592) (← links)
- Integrated capacity and inventory management with capacity acquisition lead times (Q1041940) (← links)
- Pseudo-Lipschitz property of linear semi-infinite vector optimization problems (Q1044080) (← links)
- Periodic solutions of evolution variational inequalities - a method of guiding functions (Q1044813) (← links)
- Conditional iterative proportional fitting for Gaussian distributions (Q1264524) (← links)
- Convergence analysis of some methods for minimizing a nonsmooth convex function (Q1265007) (← links)
- Feasible direction interior-point technique for nonlinear optimization (Q1273166) (← links)
- A Lagrangean heuristic for the facility location problem with staircase costs (Q1278582) (← links)
- Accelerating the regularized decomposition method for two stage stochastic linear problems (Q1278964) (← links)
- Abadie's constraint qualification, Hoffman's error bounds, and Hausdorff strong unicity (Q1288270) (← links)
- A bundle-Newton method for nonsmooth unconstrained minimization (Q1290669) (← links)
- Semi-obnoxious location models: A global optimization approach (Q1291602) (← links)
- On infeasibility of systems of convex analytic inequalities (Q1295897) (← links)
- Convex constrained programmes with unattained infima (Q1301883) (← links)
- Duality in D. C. programming: The case of several D. C. constraints (Q1305471) (← links)
- Interior-point methods with decomposition for solving large-scale linear programs (Q1306665) (← links)
- On \(\Phi\)-convexity of convex functions (Q1307287) (← links)
- A nonsmooth Newton method for elastoplastic problems (Q1348271) (← links)
- Finding the projection on a polytope: An iterative method (Q1352784) (← links)
- A preconditioning proximal Newton method for nondifferentiable convex optimization (Q1356053) (← links)
- Convergence analysis of gradient descent stochastic algorithms (Q1359455) (← links)
- Conditioning and regularization of nonsymmetric operators (Q1364222) (← links)
- A consistent approach to continuum and discrete rate elastoplastic structural problems (Q1365641) (← links)
- Necessary and sufficient global optimality conditions for convex maximization revisited (Q1378644) (← links)
- Interpolation and approximation from convex sets (Q1379569) (← links)
- Scheduling job shops with batch machines using the Lagrangian relaxation technique (Q1383473) (← links)
- Direct and dual theorems of Castigliano and Clapeyron for generalized elastic models (Q1384804) (← links)
- Subcalculus for set functions and cores of TU games. (Q1394991) (← links)