Pages that link to "Item:Q174575"
From MaRDI portal
The following pages link to Computational Optimization and Applications (Q174575):
Displaying 50 items.
- On solving linear complementarity problems by DC programming and DCA (Q409266) (← links)
- Inexact restoration method for minimization problems arising in electronic structure calculations (Q409270) (← links)
- Genetic tabu search for robust fixed channel assignment under dynamic traffic data (Q409273) (← links)
- On solving the dual for portfolio selection by optimizing conditional value at risk (Q409275) (← links)
- Special issue: Selected papers based on the presentations at the 24th IFIP TC 7 conference on system modeling and optimization, CSMO 2009, Buenos Aires, Argentina, July 27--31, 2009 (Q428468) (← links)
- Univariate cubic \(L _{1}\) interpolating splines based on the first derivative and on 5-point windows: analysis, algorithm and shape-preserving properties (Q429447) (← links)
- Markov chain analysis of genetic algorithms applied to fitness functions perturbed concurrently by additive and multiplicative noise (Q429448) (← links)
- Neural networks for solving second-order cone constrained variational inequality problem (Q429451) (← links)
- Solving VLSI design and DNA sequencing problems using bipartization of graphs (Q429453) (← links)
- Multigrid second-order accurate solution of parabolic control-constrained problems (Q429455) (← links)
- Solving survivable two-layer network design problems by metric inequalities (Q429456) (← links)
- A trust region algorithm with adaptive cubic regularization methods for nonsmooth convex minimization (Q429459) (← links)
- A note on the approximation of elliptic control problems with bang-bang controls (Q429460) (← links)
- Iterative methods for solving monotone equilibrium problems via dual gap functions (Q429462) (← links)
- Virtual control regularization of state constrained linear quadratic optimal control problems (Q429464) (← links)
- Proximal-like contraction methods for monotone variational inequalities in a unified framework. I: Effective quadruplet and primary methods (Q429465) (← links)
- Proximal-like contraction methods for monotone variational inequalities in a unified framework. II: General methods and numerical experiments (Q429466) (← links)
- Heuristics for convex mixed integer nonlinear programs (Q429468) (← links)
- A parallel algorithm for two-staged two-dimensional fixed-orientation cutting problems (Q429470) (← links)
- A local search algorithm for ray-convex polyhedron intersection (Q429472) (← links)
- Boundary concentrated finite elements for optimal boundary control problems of elliptic PDEs (Q429474) (← links)
- Adjoint IMEX-based schemes for control problems governed by hyperbolic conservation laws (Q429475) (← links)
- Adaptive and nonadaptive approaches to statistically based methods for solving stochastic linear programs: a computational investigation (Q429477) (← links)
- On the local convergence of a derivative-free algorithm for least-squares minimization (Q429479) (← links)
- Matrix-free interior point method (Q429480) (← links)
- Non-monotone projection gradient method for non-negative matrix factorization (Q429483) (← links)
- New dominance rules and exploration strategies for the \(1|r _{i}|\sum U _{i }\) scheduling problem (Q429486) (← links)
- Capital rationing problems under uncertainty and risk (Q429488) (← links)
- On the effectiveness of projection methods for convex feasibility problems with linear inequality constraints (Q429491) (← links)
- Using approximate secant equations in limited memory methods for multilevel unconstrained optimization (Q429494) (← links)
- A DC programming approach for solving the symmetric eigenvalue complementarity problem (Q429495) (← links)
- Reconstructing a matrix from a partial sampling of Pareto eigenvalues (Q429496) (← links)
- A combinatorial optimization algorithm for solving the branchwidth problem (Q429498) (← links)
- Augmented Lagrangian method with nonmonotone penalty parameters for constrained optimization (Q429499) (← links)
- Parameter identification in financial market models with a feasible point SQP algorithm (Q429503) (← links)
- A constraint-reduced variant of Mehrotra's predictor-corrector algorithm (Q429507) (← links)
- Heuristics for a project management problem with incompatibility and assignment costs (Q429511) (← links)
- A proximal point algorithm for the monotone second-order cone complementarity problem (Q429513) (← links)
- Path-following for optimal control of stationary variational inequalities (Q429514) (← links)
- Inexact trust region PGC method for large sparse unconstrained optimization (Q429517) (← links)
- Generating equidistant representations in biobjective programming (Q429518) (← links)
- How good are extrapolated bi-projection methods for linear feasibility problems? (Q429520) (← links)
- Two complexity results on \(c\)-optimality in experimental design (Q429521) (← links)
- A benchmark library and a comparison of heuristic methods for the linear ordering problem (Q429522) (← links)
- Numerical approximation of elliptic control problems with finitely many pointwise constraints (Q429525) (← links)
- A Barzilai-Borwein-based heuristic algorithm for locating multiple facilities with regional demand (Q429526) (← links)
- Semi-Lagrangian relaxation applied to the uncapacitated facility location problem (Q434153) (← links)
- Adaptive constraint reduction for convex quadratic programming (Q434155) (← links)
- A secant method for nonlinear least-squares minimization (Q434156) (← links)
- Rank-two update algorithms for the minimum volume enclosing ellipsoid problem (Q434159) (← links)
