Pages that link to "Item:Q174575"
From MaRDI portal
The following pages link to Computational Optimization and Applications (Q174575):
Displaying 50 items.
- Convex programming with single separable constraint and bounded variables (Q885824) (← links)
- Automatic differentiation of explicit Runge-Kutta methods for optimal control (Q885825) (← links)
- Newton-KKT interior-point methods for indefinite quadratic programming (Q885826) (← links)
- Globally convergent evolution strategies for constrained optimization (Q887166) (← links)
- A fast splitting method tailored for Dantzig selector (Q887167) (← links)
- Inexact accelerated augmented Lagrangian methods (Q887168) (← links)
- Combining stabilized SQP with the augmented Lagrangian algorithm (Q887169) (← links)
- A robust and informative method for solving large-scale power flow problems (Q887172) (← links)
- Finite purchasing power and computations of Bertrand-Nash equilibrium prices (Q887174) (← links)
- On a topology optimization problem governed by two-dimensional Helmholtz equation (Q887176) (← links)
- A review of distances for the Mallows and generalized Mallows estimation of distribution algorithms (Q887179) (← links)
- An improved test set approach to nonlinear integer problems with applications to engineering design (Q887181) (← links)
- Tabu search and GRASP for the capacitated clustering problem (Q887182) (← links)
- Optimizing over coherent risk measures and non-convexities: a robust mixed integer optimization approach (Q902084) (← links)
- Dynamic generation of scenario trees (Q902085) (← links)
- Scenario generation for stochastic optimization problems via the sparse grid method (Q902086) (← links)
- Mesh adaptive direct search with second directional derivative-based Hessian update (Q902088) (← links)
- Convex reformulations for solving a nonlinear network design problem (Q902090) (← links)
- AAR-based decomposition algorithm for non-linear convex optimisation (Q902092) (← links)
- A heterogeneous cellular processing algorithm for minimizing the power consumption in wireless communications systems (Q902099) (← links)
- The augmented Lagrangian method based on the APG strategy for an inverse damped gyroscopic eigenvalue problem (Q902100) (← links)
- Feasibility preserving constraint-handling strategies for real parameter evolutionary optimization (Q902102) (← links)
- Error estimates for the numerical approximation of Neumann control problems (Q941804) (← links)
- Superlinear convergence of the control reduced interior point method for PDE constrained optimization (Q941805) (← links)
- Error estimates for abstract linear-quadratic optimal control problems using proper orthogonal decomposition (Q941806) (← links)
- The Lagrange method for the regularization of discrete ill-posed problems (Q941807) (← links)
- Compact gradient tracking in shape optimization (Q941808) (← links)
- Lagrangean heuristic for primary routes assignment in survivable connection-oriented networks (Q953207) (← links)
- Interior-point methods for nonconvex nonlinear programming: Regularization and warmstarts (Q953208) (← links)
- Multi-step nonlinear conjugate gradient methods for unconstrained minimization (Q953210) (← links)
- Design and implementation of a massively parallel version of DIRECT (Q953213) (← links)
- Global optimization of truss topology with discrete bar areas. I: Theory of relaxed problems (Q953214) (← links)
- A new fictitious domain method in shape optimization (Q953216) (← links)
- Efficient preprocessing for VLSI optimization problems (Q967209) (← links)
- Continuous ant colony system and tabu search algorithms hybridized for global minimization of continuous multi-minima functions (Q967212) (← links)
- Solving chance-constrained combinatorial problems to optimality (Q967213) (← links)
- New approach for the nonlinear programming with transient stability constraints arising from power systems (Q967215) (← links)
- Smoothing algorithms for complementarity problems over symmetric cones (Q967217) (← links)
- A one-parametric class of merit functions for the second-order cone complementarity problem (Q967218) (← links)
- A computational study of exact knapsack separation for the generalized assignment problem (Q967219) (← links)
- A penalized nonparametric method for nonlinear constrained optimization based on noisy data (Q967220) (← links)
- \(\alpha \)-conservative approximation for probabilistically constrained convex programs (Q969716) (← links)
- A column generation method for the multiple-choice multi-dimensional knapsack problem (Q969718) (← links)
- A parallel interior point decomposition algorithm for block angular semidefinite programs (Q969720) (← links)
- Some non-interior path-following methods based on a scaled central path for linear complementarity problems (Q969724) (← links)
- A multi-objective optimization evolutionary algorithm incorporating preference information based on fuzzy logic (Q969726) (← links)
- Multi-objective Pareto-optimal control: An application to wastewater management (Q969727) (← links)
- Covering a compact polygonal set by identical circles (Q969729) (← links)
- Approximation of low rank solutions for linear quadratic control of partial differential equations (Q969731) (← links)
- Special issue: Campinas 2008. Selected papers based on the presentations at the 7th Brazilian workshop on continuous optimization, Campinas, CP, Brazil, July 28--31, 2008 (Q972019) (← links)