The following pages link to (Q3151174):
Displaying 50 items.
- Convergence results of an augmented Lagrangian method using the exponential penalty function (Q255069) (← links)
- Primal recovery from consensus-based dual decomposition for distributed convex optimization (Q255083) (← links)
- A Lagrangian-DNN relaxation: a fast method for computing tight lower bounds for a class of quadratic optimization problems (Q263189) (← links)
- On the application of the spectral projected gradient method in image segmentation (Q268708) (← links)
- Optimal quantization of the support of a continuous multivariate distribution based on mutual information (Q269123) (← links)
- An incremental decomposition method for unconstrained optimization (Q272371) (← links)
- Differential systems for constrained optimization via a nonlinear augmented Lagrangian (Q272481) (← links)
- An inertial forward-backward algorithm for the minimization of the sum of two nonconvex functions (Q285919) (← links)
- On the rate of convergence of the proximal alternating linearized minimization algorithm for convex problems (Q285921) (← links)
- Bounding duality gap for separable problems with linear constraints (Q288396) (← links)
- Decomposition algorithms for optimizing multi-server appointment scheduling with chance constraints (Q291063) (← links)
- On structural decompositions of finite frames (Q295388) (← links)
- Exploring trust region method for the solution of logit-based stochastic user equilibrium problem (Q297055) (← links)
- On the solution of convex QPQC problems with elliptic and other separable constraints with strong curvature (Q297833) (← links)
- On some steplength approaches for proximal algorithms (Q298853) (← links)
- A novel Lagrangian relaxation approach for a hybrid flowshop scheduling problem in the steelmaking-continuous casting process (Q299834) (← links)
- A stochastic successive minimization method for nonsmooth nonconvex optimization with applications to transceiver design in wireless communication networks (Q301668) (← links)
- On the optimality of Napoleon triangles (Q306301) (← links)
- The use of squared slack variables in nonlinear second-order cone programming (Q306383) (← links)
- Packing ellipsoids by nonlinear optimization (Q312475) (← links)
- A dual method for minimizing a nonsmooth objective over one smooth inequality constraint (Q312667) (← links)
- Trust region globalization strategy for the nonconvex unconstrained multiobjective optimization problem (Q312682) (← links)
- Using drinking data and pharmacokinetic modeling to calibrate transport model and blind deconvolution based data analysis software for transdermal alcohol biosensors (Q327562) (← links)
- Controller architectures: tradeoffs between performance and structure (Q328177) (← links)
- A weighted mirror descent algorithm for nonsmooth convex optimization problem (Q328453) (← links)
- Monotonicity and market equilibrium (Q330320) (← links)
- Sparse topical analysis of dyadic data using matrix tri-factorization (Q331699) (← links)
- A framework for and empirical study of algorithms for traffic assignment (Q337346) (← links)
- Continuous adjoint methods for turbulent flows, applied to shape and topology optimization: industrial applications (Q338791) (← links)
- Optimal iterative QP and QPQC algorithms (Q338894) (← links)
- Constraint qualifications and optimality conditions for optimization problems with cardinality constraints (Q344949) (← links)
- Efficient accuracy evaluation for multi-modal sensed data (Q346487) (← links)
- Enhanced Karush-Kuhn-Tucker condition and weaker constraint qualifications (Q353154) (← links)
- Subgradient method for nonconvex nonsmooth optimization (Q353174) (← links)
- Complexity of solution structures in nonlinear pricing (Q363545) (← links)
- Tacit collusion games in pool-based electricity markets under transmission constraints (Q368752) (← links)
- A model-free no-arbitrage price bound for variance options (Q373003) (← links)
- Fast alternating linearization methods for minimizing the sum of two convex functions (Q378095) (← links)
- Forward-backward penalty scheme for constrained convex minimization without inf-compactness (Q378270) (← links)
- Constrained multifidelity optimization using model calibration (Q381821) (← links)
- Low-rank tensor completion by Riemannian optimization (Q398628) (← links)
- Block coordinate descent algorithms for large-scale sparse multiclass classification (Q399900) (← links)
- Simultaneous clustering and classification over cluster structure representation (Q408041) (← links)
- Sequence classification via large margin hidden Markov models (Q408657) (← links)
- On camera calibration with linear programming and loop constraint linearization (Q409179) (← links)
- On penalty and gap function methods for bilevel equilibrium problems (Q410808) (← links)
- SpicyMKL: a fast algorithm for multiple kernel learning with thousands of kernels (Q413881) (← links)
- Dual coordinate descent methods for logistic regression and maximum entropy models (Q413884) (← links)
- An improved Newton projection method for nonnegative deblurring of Poisson-corrupted images with Tikhonov regularization (Q415336) (← links)
- Coupling the gradient method with a general exterior penalization scheme for convex minimization (Q415412) (← links)
