Pages that link to "Item:Q174575"

The following pages link to Computational Optimization and Applications (Q174575):

Displaying 50 items.

• A Lyusternik-Graves theorem for the proximal point method (Q694520) (← links)
• Vortex control in channel flows using translational invariant cost functionals (Q694521) (← links)
• A polynomial optimization approach to constant rebalanced portfolio selection (Q694522) (← links)
• An exact method with variable fixing for solving the generalized assignment problem (Q694523) (← links)
• Customized simulated annealing based decision algorithms for combinatorial optimization in VLSI floorplanning problem (Q694524) (← links)
• An efficient simultaneous method for the constrained multiple-sets split feasibility problem (Q694525) (← links)
• Properties and construction of NCP functions (Q694526) (← links)
• PAINT: Pareto front interpolation for nonlinear multiobjective optimization (Q694527) (← links)
• Edge-based semidefinite programming relaxation of sensor network localization with lower bound constraints (Q694528) (← links)
• An intermodal multicommodity routing problem with scheduled services (Q694530) (← links)
• A measure space approach to optimal source placement (Q694531) (← links)
• A general theorem on error estimates with application to a quasilinear elliptic optimal control problem (Q694532) (← links)
• Convergence of the forward-backward sweep method in optimal control (Q694534) (← links)
• Balanced POD for linear PDE robust control computations (Q694536) (← links)
• A multi-swarm PSO using charged particles in a partitioned search space for continuous optimization (Q694538) (← links)
• An inexact spectral bundle method for convex quadratic semidefinite programming (Q694539) (← links)
• The nearest point problem in a polyhedral set and its extensions (Q694540) (← links)
• Relaxed cutting plane method with convexification for solving nonlinear semi-infinite programming problems (Q694542) (← links)
• Updating the regularization parameter in the adaptive cubic regularization algorithm (Q694543) (← links)
• A hybrid ODE-based method for unconstrained optimization problems (Q694546) (← links)
• Regularization for semilinear elliptic optimal control problems with pointwise state and control constraints (Q694587) (← links)
• Cooperation and competition in multidisciplinary optimization (Q694588) (← links)
• Finite element error estimates for Neumann boundary control problems on graded meshes (Q694590) (← links)
• On a Kohn-Vogelius like formulation of free boundary problems (Q694592) (← links)
• The discretizable molecular distance geometry problem (Q694593) (← links)
• A filter trust-region algorithm for unconstrained optimization with strong global convergence properties (Q694595) (← links)
• Stability of semilinear elliptic optimal control problems with pointwise state constraints (Q694597) (← links)
• Numerical methods for \(A\)-optimal designs with a sparsity constraint for ill-posed inverse problems (Q694600) (← links)
• A nonmonotone PSB algorithm for solving unconstrained optimization (Q694601) (← links)
• Local path-following property of inexact interior methods in nonlinear programming (Q694602) (← links)
• A numerical algorithm for finding solutions of a generalized Nash equilibrium problem (Q694603) (← links)
• Sensitivity analysis of hyperbolic optimal control problems (Q694605) (← links)
• Lower bound for the interatomic distance in Lennard-Jones clusters (Q702468) (← links)
• Increasing internet capacity using local search (Q702469) (← links)
• Conjugate grids for unconstrained optimisation (Q702470) (← links)
• Remarks on the analytic centers of convex sets (Q702471) (← links)
• Approximate gradient projection method with Runge-Kutta schemes for optimal control prob\-lems (Q702475) (← links)
• Telecommunication network capacity design for uncertain demand (Q702479) (← links)
• Securitization of financial assets: approximation in theory and practice (Q702480) (← links)
• Numerical experiments with an interior-exterior point method for nonlinear programming (Q702481) (← links)
• Least squares convex-concave data smoothing (Q702482) (← links)
• An efficient algorithm for generating univariate cubic \(L_1\) splines (Q702483) (← links)
• Route planning for agent-based information retrieval (Q707765) (← links)
• Morse potential energy minimization: Improved bounds for optimal configurations (Q707766) (← links)
• Solving job shop scheduling problems utilizing the properties of backbone and ``big valley'' (Q707768) (← links)
• Extended duality for nonlinear programming (Q707770) (← links)
• A posteriori error estimates for a finite element discretization of interior point methods for an elliptic optimization problem with state constraints (Q707771) (← links)
• Finding the shortest path with honey-bee mating optimization algorithm in project management problems with constrained/unconstrained resources (Q707776) (← links)
• A relaxation algorithm with a probabilistic guarantee for robust deviation optimization (Q707779) (← links)
• Numerical approximation of the LQR problem in a strongly damped wave equation (Q707780) (← links)