Pages that link to "Item:Q174575"
From MaRDI portal
The following pages link to Computational Optimization and Applications (Q174575):
Displayed 50 items.
- Alternating direction method of multipliers for penalized zero-variance discriminant analysis (Q97537) (← links)
- An MM Algorithm for Split Feasibility Problems (Q150985) (← links)
- On an inexact trust-region SQP-filter method for constrained nonlinear optimization (Q263150) (← links)
- Active-set prediction for interior point methods using controlled perturbations (Q263153) (← links)
- On the solution of convex bilevel optimization problems (Q263155) (← links)
- Approximated perspective relaxations: a project and lift approach (Q263157) (← links)
- Towards an objective feasibility pump for convex minlps (Q263161) (← links)
- Branch-and-cut-and-price algorithms for the degree constrained minimum spanning tree problem (Q263164) (← links)
- Finite element error estimates for an optimal control problem governed by the Burgers equation (Q263166) (← links)
- Dirichlet control of elliptic state constrained problems (Q263168) (← links)
- Numerical enclosures of the optimal cost of the Kantorovitch's mass transportation problem (Q263172) (← links)
- On multiobjective selection for multimodal optimization (Q263175) (← links)
- Analysis of multi-objective Kriging-based methods for constrained global optimization (Q263179) (← links)
- On an adaptive regularization for ill-posed nonlinear systems and its trust-region implementation (Q276850) (← links)
- An adaptive accelerated first-order method for convex optimization (Q276852) (← links)
- A bundle method using two polyhedral approximations of the \(\epsilon \)-enlargement of a maximal monotone operator (Q276854) (← links)
- A Dai-Yuan-type Riemannian conjugate gradient method with the weak Wolfe conditions (Q276855) (← links)
- Two-stage convex relaxation approach to least squares loss constrained low-rank plus sparsity optimization problems (Q276859) (← links)
- Higher-degree eigenvalue complementarity problems for tensors (Q276860) (← links)
- Exact MIP-based approaches for finding maximum quasi-cliques and dense subgraphs (Q276864) (← links)
- Exact solution approaches for bilevel assignment problems (Q276866) (← links)
- A new local dimming algorithm based on the simplex method (Q276871) (← links)
- Optimization of nonlocal time-delayed feedback controllers (Q276874) (← links)
- Discretization of semilinear bang-singular-bang control problems (Q276875) (← links)
- A generalization of \(\omega \)-subdivision ensuring convergence of the simplicial algorithm (Q286595) (← links)
- Distortion compensation as a shape optimisation problem for a sharp interface model (Q286598) (← links)
- Optimal averaged Hausdorff archives for bi-objective problems: theoretical and numerical results (Q286603) (← links)
- An inertia-free filter line-search algorithm for large-scale nonlinear programming (Q288393) (← links)
- Bounding duality gap for separable problems with linear constraints (Q288396) (← links)
- Clustering-based preconditioning for stochastic programs (Q288399) (← links)
- Variance reduction in Monte Carlo sampling-based optimality gap estimators for two-stage stochastic linear programming (Q288402) (← links)
- Constrained incremental bundle method with partial inexact oracle for nonsmooth convex semi-infinite programming problems (Q288406) (← links)
- Sufficient weighted complementarity problems (Q288407) (← links)
- On how to solve large-scale log-determinant optimization problems (Q288409) (← links)
- Theoretical and computational results about optimality-based domain reductions (Q288410) (← links)
- Stochastic derivative-free optimization using a trust region framework (Q301671) (← links)
- Computing the distance between the linear matrix pencil and the completely positive cone (Q301674) (← links)
- A fast dual proximal-gradient method for separable convex optimization with linear coupled constraints (Q301677) (← links)
- The split Bregman algorithm applied to PDE-constrained optimization problems with total variation regularization (Q301680) (← links)
- Nonlinear residual minimization by iteratively reweighted least squares (Q301685) (← links)
- State-defect constraint pairing graph coarsening method for Karush-Kuhn-Tucker matrices arising in orthogonal collocation methods for optimal control (Q301689) (← links)
- Selective bi-coordinate variations for resource allocation type problems (Q301690) (← links)
- Column generation approaches for the software clustering problem (Q301694) (← links)
- Feature subset selection for logistic regression via mixed integer optimization (Q301699) (← links)
- Local convex hulls for a special class of integer multicommodity flow problems (Q301702) (← links)
- A two-level approach to large mixed-integer programs with application to cogeneration in energy-efficient buildings (Q316165) (← links)
- A specialized branch-and-bound algorithm for the Euclidean Steiner tree problem in \(n\)-space (Q316167) (← links)
- Integer programming models and branch-and-cut approaches to generalized \(\{0,1,2\}\)-survivable network design problems (Q316168) (← links)
- On the global convergence of the inexact semi-smooth Newton method for absolute value equation (Q316170) (← links)
- A semismooth Newton method for tensor eigenvalue complementarity problem (Q316172) (← links)