Pages that link to "Item:Q174575"
From MaRDI portal
The following pages link to Computational Optimization and Applications (Q174575):
Displaying 50 items.
- Method for solving bang-bang and singular optimal control problems using adaptive Radau collocation (Q2114836) (← links)
- A priori error estimate of perturbation method for optimal control problem governed by elliptic PDEs with small uncertainties (Q2114838) (← links)
- Finding the global optimum of a class of quartic minimization problem (Q2114839) (← links)
- Leveraging special-purpose hardware for local search heuristics (Q2125062) (← links)
- An adaptive trust-region method without function evaluations (Q2125064) (← links)
- A regularized limited memory BFGS method for large-scale unconstrained optimization and its efficient implementations (Q2125067) (← links)
- Local saddle points for unconstrained polynomial optimization (Q2125068) (← links)
- Parametric shape optimization using the support function (Q2125069) (← links)
- An inexact successive quadratic approximation method for a class of difference-of-convex optimization problems (Q2125070) (← links)
- Complexity of an inexact proximal-point penalty method for constrained smooth non-convex optimization (Q2125072) (← links)
- Robust output-feedback stabilization for incompressible flows using low-dimensional \(\mathcal{H}_{\infty}\)-controllers (Q2125074) (← links)
- SDP-based bounds for graph partition via extended ADMM (Q2125076) (← links)
- Derivative-free methods for mixed-integer nonsmooth constrained optimization (Q2141352) (← links)
- On initial point selection of the steepest descent algorithm for general quadratic functions (Q2141353) (← links)
- Accelerated gradient sliding for structured convex optimization (Q2141354) (← links)
- Douglas-Rachford splitting and ADMM for nonconvex optimization: accelerated and Newton-type linesearch algorithms (Q2141355) (← links)
- Malitsky-Tam forward-reflected-backward splitting method for nonconvex minimization problems (Q2141356) (← links)
- Second order semi-smooth proximal Newton methods in Hilbert spaces (Q2141359) (← links)
- A level set method for Laplacian eigenvalue optimization subject to geometric constraints (Q2141360) (← links)
- QUAntum particle swarm optimization: an auto-adaptive PSO for local and global optimization (Q2141363) (← links)
- Finite-sum smooth optimization with SARAH (Q2149950) (← links)
- Randomized Kaczmarz methods for tensor complementarity problems (Q2149951) (← links)
- Cut-sharing across trees and efficient sequential sampling for SDDP with uncertainty in the RHS (Q2149952) (← links)
- DC semidefinite programming and cone constrained DC optimization. I: Theory (Q2149953) (← links)
- Accelerated inexact composite gradient methods for nonconvex spectral optimization problems (Q2149955) (← links)
- Design of a heuristic algorithm for the generalized multi-objective set covering problem (Q2149956) (← links)
- A path-following inexact Newton method for PDE-constrained optimal control in BV (Q2149957) (← links)
- Block coordinate descent for smooth nonconvex constrained minimization (Q2162523) (← links)
- Quantifying uncertainty with ensembles of surrogates for blackbox optimization (Q2162525) (← links)
- Polyhedral analysis and a new algorithm for the length constrained \(K\)-drones rural postman problem (Q2162526) (← links)
- Robust min-max regret covering problems (Q2162527) (← links)
- A stochastic primal-dual method for a class of nonconvex constrained optimization (Q2162528) (← links)
- Sub-linear convergence of a stochastic proximal iteration method in Hilbert space (Q2162529) (← links)
- Projected orthogonal vectors in two-dimensional search interior point algorithms for linear programming (Q2162530) (← links)
- Inertial alternating direction method of multipliers for non-convex non-smooth optimization (Q2162531) (← links)
- Fast inertial dynamic algorithm with smoothing method for nonsmooth convex optimization (Q2162532) (← links)
- A product space reformulation with reduced dimension for splitting algorithms (Q2162533) (← links)
- Abstract strongly convergent variants of the proximal point algorithm (Q2162534) (← links)
- Numerically tractable optimistic bilevel problems (Q2181593) (← links)
- An efficient adaptive accelerated inexact proximal point method for solving linearly constrained nonconvex composite problems (Q2181594) (← links)
- Accelerating incremental gradient optimization with curvature information (Q2181597) (← links)
- Inexact first-order primal-dual algorithms (Q2181598) (← links)
- Quantitative analysis for a class of two-stage stochastic linear variational inequality problems (Q2181599) (← links)
- Algorithms for stochastic optimization with function or expectation constraints (Q2181600) (← links)
- The Pontryagin maximum principle for solving Fokker-Planck optimal control problems (Q2181601) (← links)
- Feasibility and a fast algorithm for Euclidean distance matrix optimization with ordinal constraints (Q2181603) (← links)
- A differentiable path-following algorithm for computing perfect stationary points (Q2181604) (← links)
- A computationally useful algebraic representation of nonlinear disjunctive convex sets using the perspective function (Q2181606) (← links)
- Preface of the special issue dedicated to the XII Brazilian workshop on continuous optimization (Q2191779) (← links)
- An inexact proximal generalized alternating direction method of multipliers (Q2191781) (← links)
