Pages that link to "Item:Q174575"
From MaRDI portal
The following pages link to Computational Optimization and Applications (Q174575):
Displaying 50 items.
- A model for optimal execution of atomic orders (Q975353) (← links)
- Convergence of direct methods for paramonotone variational inequalities (Q975354) (← links)
- Residual algorithm for large-scale positive definite generalized eigenvalue problems (Q975355) (← links)
- Inexact Josephy-Newton framework for generalized equations and its applications to local analysis of Newtonian methods for constrained optimization (Q975356) (← links)
- Globalization strategies for mesh adaptive direct search (Q975357) (← links)
- A new line search inexact restoration approach for nonlinear programming (Q975358) (← links)
- Addressing the greediness phenomenon in nonlinear programming by means of proximal augmented Lagrangians (Q975359) (← links)
- Proximal methods for nonlinear programming: Double regularization and inexact subproblems (Q975360) (← links)
- Incorporating minimum Frobenius norm models in direct search (Q975361) (← links)
- Incremental-like bundle methods with application to energy planning (Q975362) (← links)
- Multi-step methods for choosing the best set of variables in regression analysis (Q989838) (← links)
- Adaptive finite element methods for mixed control-state constrained optimal control problems for elliptic boundary value problems (Q989840) (← links)
- Portfolio optimization by minimizing conditional value-at-risk via nondifferentiable optimization (Q989841) (← links)
- A multiobjective metaheuristic for a mean-risk static stochastic knapsack problem (Q989843) (← links)
- Variational discretization of Lavrentiev-regularized state constrained elliptic optimal control problems (Q989844) (← links)
- A comparison of feasible direction methods for the stochastic transportation problem (Q989847) (← links)
- A shape and topology optimization technique for solving a class of linear complementarity problems in function space (Q989848) (← links)
- Concave programming for minimizing the zero-norm over polyhedral sets (Q989849) (← links)
- Stochastic programming for nurse assignment (Q1001188) (← links)
- A comparative study of decomposition algorithms for stochastic combinatorial optimization (Q1001189) (← links)
- A family of NCP functions and a descent method for the nonlinear complementarity problem (Q1001190) (← links)
- Quasi-Newton acceleration for equality-constrained minimization (Q1001193) (← links)
- Outdoor WLAN planning via non-monotone derivative-free optimization: Algorithm adaptation and case study (Q1001196) (← links)
- An algorithm for the generalized quadratic assignment problem (Q1001198) (← links)
- A note on sparse SOS and SDP relaxations for polynomial optimization problems over symmetric cones (Q1001199) (← links)
- Convergent Lagrangian and domain cut method for nonlinear knapsack problems (Q1001200) (← links)
- A regularization method for the numerical solution of elliptic boundary control problems with pointwise state constraints (Q1001201) (← links)
- Reconstructing (0,1)-matrices from projections using integer programming (Q1001203) (← links)
- A smoothing projected Newton-type algorithm for semi-infinite programming (Q1001204) (← links)
- A linear code parameter search algorithm with applications to immunology (Q1001207) (← links)
- Local models-an approach to distributed multi-objective optimization (Q1001209) (← links)
- Implementation of warm-start strategies in interior-point methods for linear programming in fixed dimension (Q1029621) (← links)
- A new trust region method with adaptive radius (Q1029622) (← links)
- Numerical experiments with universal barrier functions for cones of Chebyshev systems (Q1029624) (← links)
- Globally convergent Jacobian smoothing inexact Newton methods for NCP (Q1029625) (← links)
- Convexity of chance constraints with independent random variables (Q1029626) (← links)
- Progress in the dual simplex algorithm for solving large scale LP problems: Techniques for a fast and stable implementation (Q1029627) (← links)
- Connections between the covector mapping theorem and convergence of pseudospectral methods for optimal control (Q1029629) (← links)
- A recursive algorithm for constrained two-dimensional cutting problems (Q1029631) (← links)
- Further development of multiple centrality correctors for interior point methods (Q1029632) (← links)
- Probability-one homotopy maps for mixed complementarity problems (Q1029634) (← links)
- A global continuation algorithm for solving binary quadratic programming problems (Q1029635) (← links)
- Optimization of arches using genetic algorithm (Q1029639) (← links)
- Special issue: Selected papers from the 23rd IFIP TC 7 conference on system modeling and optimization, CSMO 2007, Cracow, Poland, July 23--27, 2007. (Q1040184) (← links)
- Auction algorithms for network flow problems: A tutorial introduction (Q1202585) (← links)
- An inexact NE/SQP method for solving the nonlinear complementarity problem (Q1202586) (← links)
- Application of the alternating direction method of multipliers to separable convex programming problems (Q1202587) (← links)
- Numerical solution of a nonlinear parabolic control problem by a reduced SQP method (Q1202589) (← links)
- Parametric simplex algorithms for a class of NP-complete problems whose average number of steps is polynomial (Q1203065) (← links)
- Primal-dual proximal point algorithm for linearly constrained convex programming problems (Q1203067) (← links)
