Pages that link to "Item:Q174575"

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

Displaying 50 items.

• Shrinking gradient descent algorithms for total variation regularized image denoising (Q1694398) (← links)
• An efficient algorithm for the single facility location problem with polyhedral norms and disk-shaped demand regions (Q1694399) (← links)
• MDTri: robust and efficient global mixed integer search of spaces of multiple ternary alloys. A DIRECT-inspired optimization algorithm for experimentally accessible computational material design (Q1694401) (← links)
• Algorithms for generalized potential games with mixed-integer variables (Q1694402) (← links)
• Markov-Dubins path via optimal control theory (Q1694403) (← links)
• Decomposition methods based on articulation vertices for degree-dependent spanning tree problems (Q1694405) (← links)
• Variable neighborhood scatter search for the incremental graph drawing problem (Q1694406) (← links)
• Proximal alternating penalty algorithms for nonsmooth constrained convex optimization (Q1734766) (← links)
• On monotone and primal-dual active set schemes for \(\ell^p\)-type problems, \(p \in (0,1]\) (Q1734767) (← links)
• Asynchronous parallel primal-dual block coordinate update methods for affinely constrained convex programs (Q1734768) (← links)
• Structured nonconvex and nonsmooth optimization: algorithms and iteration complexity analysis (Q1734769) (← links)
• Newton's method with feasible inexact projections for solving constrained generalized equations (Q1734771) (← links)
• Convergence of the augmented decomposition algorithm (Q1734773) (← links)
• A globally convergent Levenberg-Marquardt method for equality-constrained optimization (Q1734774) (← links)
• A homogeneous model for monotone mixed horizontal linear complementarity problems (Q1734775) (← links)
• On the optimal solution set in interval linear programming (Q1734777) (← links)
• An implicit filtering algorithm for derivative-free multiobjective optimization with box constraints (Q1744880) (← links)
• A proximal difference-of-convex algorithm with extrapolation (Q1744881) (← links)
• A globally convergent LP-Newton method for piecewise smooth constrained equations: escaping nonstationary accumulation points (Q1744883) (← links)
• MINQ8: general definite and bound constrained indefinite quadratic programming (Q1744884) (← links)
• A novel approach for ellipsoidal outer-approximation of the intersection region of ellipses in the plane (Q1744887) (← links)
• Higher-order numerical scheme for linear quadratic problems with bang-bang controls (Q1744889) (← links)
• A Fokker-Planck approach to control collective motion (Q1744890) (← links)
• An efficient duality-based approach for PDE-constrained sparse optimization (Q1744892) (← links)
• A study of the Bienstock-Zuckerberg algorithm: applications in mining and resource constrained project scheduling (Q1744895) (← links)
• An efficient computational method for large scale surgery scheduling problems with chance constraints (Q1744896) (← links)
• A two-stage stochastic programming approach for influence maximization in social networks (Q1744898) (← links)
• Proximal quasi-Newton methods for regularized convex optimization with linear and accelerated sublinear convergence rates (Q1744900) (← links)
• A nonmonotone trust-region method for generalized Nash equilibrium and related problems with strong convergence properties (Q1744902) (← links)
• A two-level graph partitioning problem arising in mobile wireless communications (Q1744904) (← links)
• Semidefinite programming approach for the quadratic assignment problem with a sparse graph (Q1744907) (← links)
• Decomposition methods for the two-stage stochastic Steiner tree problem (Q1744908) (← links)
• A comparison of different routing schemes for the robust network loading problem: polyhedral results and computation (Q1744909) (← links)
• Augmented Lagrangian and exact penalty methods for quasi-variational inequalities (Q1744910) (← links)
• Euler discretization for a class of nonlinear optimal control problems with control appearing linearly (Q1744911) (← links)
• An augmented Lagrange method for elliptic state constrained optimal control problems (Q1744913) (← links)
• Real eigenvalues of nonsymmetric tensors (Q1753066) (← links)
• A copositive approach for two-stage adjustable robust optimization with uncertain right-hand sides (Q1753067) (← links)
• Time-optimal velocity planning by a bound-tightening technique (Q1753068) (← links)
• Accelerated primal-dual proximal block coordinate updating methods for constrained convex optimization (Q1753069) (← links)
• Generalized symmetric ADMM for separable convex optimization (Q1753070) (← links)
• Two smooth support vector machines for \(\varepsilon \)-insensitive regression (Q1753072) (← links)
• Iterative reweighted methods for \(\ell _1-\ell _p\) minimization (Q1753073) (← links)
• On the convergence of the gradient projection method for convex optimal control problems with bang-bang solutions (Q1753075) (← links)
• Improved approximation rates for a parabolic control problem with an objective promoting directional sparsity (Q1753076) (← links)
• MIP-based instantaneous control of mixed-integer PDE-constrained gas transport problems (Q1753078) (← links)
• Tikhonov regularization of control-constrained optimal control problems (Q1753080) (← links)
• COAP 2017 Best Paper Prize (Q1756571) (← links)
• A specialized primal-dual interior point method for the plastic truss layout optimization (Q1756573) (← links)
• Pricing and revenue maximization over a multicommodity transportation network: the nonlinear demand case (Q1756575) (← links)