Pages that link to "Item:Q2436647"
From MaRDI portal
The following pages link to MM algorithms for geometric and signomial programming (Q2436647):
Displaying 13 items.
- Global optimization of signomial geometric programming problems (Q296971) (← links)
- A MILP formulation for generalized geometric programming using piecewise-linear approximations (Q319582) (← links)
- Path following in the exact penalty method of convex programming (Q493687) (← links)
- Maximum likelihood estimation for incomplete multinomial data via the weaver algorithm (Q1616785) (← links)
- A novel optimization method for nonconvex quadratically constrained quadratic programs (Q1724769) (← links)
- Analysis of generalized Bregman surrogate algorithms for nonsmooth nonconvex statistical learning (Q2073715) (← links)
- A practicable contraction approach for the sum of the generalized polynomial ratios problem (Q2424762) (← links)
- Accelerating method of global optimization for signomial geometric programming (Q2479370) (← links)
- MM Algorithms for Variance Components Models (Q3391241) (← links)
- Another Look at Distance-Weighted Discrimination (Q4603806) (← links)
- A signomial programming-based approach for multi-echelon supply chain disruption risk assessment with robust dynamic Bayesian network (Q6065614) (← links)
- Flexible Expectile Regression in Reproducing Kernel Hilbert Spaces (Q6622403) (← links)
- Min-max framework for majorization-minimization algorithms in signal processing applications: an overview (Q6638675) (← links)
