Pages that link to "Item:Q174575"
From MaRDI portal
The following pages link to Computational Optimization and Applications (Q174575):
Displaying 50 items.
- New results on subgradient methods for strongly convex optimization problems with a unified analysis (Q316174) (← links)
- Nonconvex bundle method with application to a delamination problem (Q316176) (← links)
- Conjugate gradient acceleration of iteratively re-weighted least squares methods (Q316180) (← links)
- Global minima for semilinear optimal control problems (Q316183) (← links)
- A proximal point algorithm based on decomposition method for cone constrained multiobjective optimization problems (Q316185) (← links)
- Algorithmic aspects of sums of Hermitian squares of noncommutative polynomials (Q354616) (← links)
- Mixed-integer linear programming formulations for the software clustering problem (Q354618) (← links)
- Modified subspace Barzilai-Borwein gradient method for non-negative matrix factorization (Q354621) (← links)
- Combining Lagrangian decomposition and excessive gap smoothing technique for solving large-scale separable convex optimization problems (Q354625) (← links)
- A computational study and survey of methods for the single-row facility layout problem (Q354626) (← links)
- SDP reformulation for robust optimization problems based on nonconvex QP duality (Q354630) (← links)
- Erratum to: A trust region method for solving semidefinite programs (Q354632) (← links)
- A second-order smooth penalty function algorithm for constrained optimization problems (Q354635) (← links)
- Vortex control of instationary channel flows using translation invariant cost functionals (Q354637) (← links)
- Relaxation methods for mixed-integer optimal control of partial differential equations (Q354639) (← links)
- A trust region method for solving semidefinite programs (Q354640) (← links)
- Algorithms for detecting optimal hereditary structures in graphs, with application to clique relaxations (Q360375) (← links)
- A homotopy method for nonlinear semidefinite programming (Q360377) (← links)
- Multi agent collaborative search based on Tchebycheff decomposition (Q360379) (← links)
- Error estimates for parabolic optimal control problems with control and state constraints (Q360380) (← links)
- Algorithmic improvements on dynamic programming for the bi-objective \(\{0,1\}\) knapsack problem (Q360382) (← links)
- A derivative-free approximate gradient sampling algorithm for finite minimax problems (Q360384) (← links)
- A simplex-based numerical framework for simple and efficient robust design optimization (Q360385) (← links)
- A Shamanskii-like Levenberg-Marquardt method for nonlinear equations (Q360386) (← links)
- Using inexact gradients in a multilevel optimization algorithm (Q360389) (← links)
- On the optimal control of the Schlögl-model (Q360393) (← links)
- Erratum to: On the optimal control of the Schlögl-model (Q360394) (← links)
- Parameter-less algorithm for evolutionary-based optimization: for continuous and combinatorial problems (Q360396) (← links)
- Studying the effect of using low-discrepancy sequences to initialize population-based optimization algorithms (Q377716) (← links)
- Frequency assignment in a SDMA satellite communication system with beam decentring feature (Q377718) (← links)
- Implementing the simplex method as a cutting-plane method, with a view to regularization (Q377719) (← links)
- The continuous differential ant-stigmergy algorithm for numerical optimization (Q377722) (← links)
- Symmetric Perry conjugate gradient method (Q377723) (← links)
- A semismooth Newton method for a class of semilinear optimal control problems with box and volume constraints (Q377725) (← links)
- CARTopt: a random search method for nonsmooth unconstrained optimization (Q377726) (← links)
- Lower and upper bounds for the spanning tree with minimum branch vertices (Q377727) (← links)
- Preconditioning Newton-Krylov methods in nonconvex large scale optimization (Q377728) (← links)
- A class of distributed optimization methods with event-triggered communication (Q404510) (← links)
- Level bundle methods for constrained convex optimization with various oracles (Q404512) (← links)
- A derivative-free algorithm for linearly constrained optimization problems (Q404515) (← links)
- Curvature integrals and iteration complexities in SDP and symmetric cone programs (Q404518) (← links)
- On regularity conditions for complementarity problems (Q404520) (← links)
- A numerical method for nonconvex multi-objective optimal control problems (Q404521) (← links)
- A priori error analysis of the upwind symmetric interior penalty Galerkin (SIPG) method for the optimal control problems governed by unsteady convection diffusion equations (Q404524) (← links)
- Adaptive sequencing of primal, dual, and design steps in simulation based optimization (Q404526) (← links)
- Enhancing performance of particle swarm optimization through an algorithmic link with genetic algorithms (Q404529) (← links)
- Multi-product lot-sizing and sequencing on a single imperfect machine (Q409261) (← links)
- Counterexamples to a triality theorem in ``canonical dual least square method'' (Q409262) (← links)
- An efficient DC programming approach for portfolio decision with higher moments (Q409263) (← links)
- Gradient algorithms for quadratic optimization with fast convergence rates (Q409265) (← links)
