The following pages link to (Q4382667):
Displaying 50 items.
- A fixed point iterative approach to integer programming and its distributed computation (Q288180) (← links)
- A smoothing SQP framework for a class of composite \(L_q\) minimization over polyhedron (Q304258) (← links)
- An efficient fifth-order method for linear optimization (Q306315) (← links)
- An efficient primal-dual interior point method for linear programming problems based on a new kernel function with a trigonometric barrier term (Q306399) (← links)
- A new primal-dual predictor-corrector interior-point method for linear programming based on a wide neighbourhood (Q306400) (← links)
- Infeasible interior-point methods for linear optimization based on large neighborhood (Q306402) (← links)
- Mathematical programming approaches for classes of random network problems (Q319592) (← links)
- Improved branching disjunctions for branch-and-bound: an analytic center approach (Q319920) (← links)
- Scheduling under linear constraints (Q323163) (← links)
- A logarithmic barrier approach for linear programming (Q329787) (← links)
- Recursive central rounding for mixed integer programs (Q336910) (← links)
- A polynomial-time solution scheme for quadratic stochastic programs (Q368716) (← links)
- A second order Mehrotra-type predictor-corrector algorithm for semidefinite optimization (Q394386) (← links)
- CVXGEN: a code generator for embedded convex optimization (Q399985) (← links)
- An adaptive-step primal-dual interior point algorithm for linear optimization (Q425813) (← links)
- Interior-point methods for linear optimization based on a kernel function with a trigonometric barrier term (Q432785) (← links)
- A study of the dual affine scaling continuous trajectories for linear programming (Q481775) (← links)
- Nearly-linear work parallel SDD solvers, low-diameter decomposition, and low-stretch subgraphs (Q487267) (← links)
- A modified infeasible-interior-point algorithm for linear optimization problems (Q493065) (← links)
- Improved bounds on the energy-minimizing strains in martensitic polycrystals (Q510633) (← links)
- An eigenvalue decomposition based branch-and-bound algorithm for nonconvex quadratic programming problems with convex quadratic constraints (Q513160) (← links)
- Approximation accuracy, gradient methods, and error bound for structured convex optimization (Q607498) (← links)
- A novel non-linear approach to minimal area rectangular packing (Q610981) (← links)
- Existence, uniqueness, and convergence of the regularized primal-dual central path (Q613327) (← links)
- An interior point cutting plane heuristic for mixed integer programming (Q632679) (← links)
- Hybrid regularization methods for seismic reflectivity inversion (Q644417) (← links)
- A note on the complexity of \(L _{p }\) minimization (Q644905) (← links)
- Primal and dual linear decision rules in stochastic and robust optimization (Q647394) (← links)
- Probabilistic analysis of a differential equation for linear programming (Q652446) (← links)
- A convex relaxation bound for subgraph isomorphism (Q666533) (← links)
- An interior-point algorithm for linear optimization based on a new barrier function (Q720625) (← links)
- An efficient parameterized logarithmic kernel function for linear optimization (Q723500) (← links)
- New method for determining search directions for interior-point algorithms in linear optimization (Q723503) (← links)
- Space tensor conic programming (Q742309) (← links)
- Complexity analysis and numerical implementation of a full-Newton step interior-point algorithm for LCCO (Q747738) (← links)
- An efficient twice parameterized trigonometric kernel function for linear optimization (Q779775) (← links)
- An extension of interior point potential reduction algorithm to solve general lcps (Q835795) (← links)
- Representing the space of linear programs as the Grassmann manifold (Q847840) (← links)
- Fuzzy goal programming: complementary slackness conditions and computational schemes (Q849750) (← links)
- A new path-following algorithm for nonlinear \(P_*\) complementarity problems (Q853548) (← links)
- Optimal scaling of a gradient method for distributed resource allocation (Q868539) (← links)
- An interior-point \(\ell_{\frac{1}{2}}\)-penalty method for inequality constrained nonlinear optimization (Q898716) (← links)
- A new class of copulas involved geometric distribution: estimation and applications (Q903321) (← links)
- A new full Nesterov-Todd step feasible interior-point method for convex quadratic symmetric cone optimization (Q905304) (← links)
- Parabolic target space and primal-dual interior-point methods (Q943845) (← links)
- George B. Dantzig and systems optimization (Q951088) (← links)
- A non-interior-point smoothing method for variational inequality problem (Q966082) (← links)
- ACUTA: a novel method for eliciting additive value functions on the basis of holistic preference statements (Q976334) (← links)
- Lower-order penalization approach to nonlinear semidefinite programming (Q995945) (← links)
- Enlarging neighborhoods of interior-point algorithms for linear programming via least values of proximity measure functions (Q997220) (← links)
