The following pages link to SIAM Journal on Optimization (Q60872):
Displaying 50 items.
- Condition-measure bounds on the behavior of the central trajectory of a semidefinite program (Q2706356) (← links)
- A direct search algorithm for optimization with noisy function evaluations (Q2706357) (← links)
- On the convergence of grid-based methods for unconstrained optimization (Q2706358) (← links)
- A scaled Gauss--Newton primal-dual search direction for semidefinite optimization (Q2706359) (← links)
- Nonmonotone trust-region methods for bound-constrained semismooth equations with applications to nonlinear mixed complementarity problems (Q2706360) (← links)
- Convergence properties of a regularization scheme for mathematical programs with complementarity constraints (Q2719233) (← links)
- Second-order algorithms for generalized finite and semi-infinite min-max problems (Q2719234) (← links)
- Monotonicity of fixed point and normal mappings associated with variational inequality and its application (Q2719235) (← links)
- Superlinear convergence of primal-dual interior point algorithms for nonlinear programming (Q2719236) (← links)
- The set of divergent descent methods in a Banach space is \(\sigma\)-porous (Q2719237) (← links)
- FATCOP: A fault tolerant condor-PVM mixed integer programming solver (Q2719238) (← links)
- Limiting average criteria for nonstationary Markov decision processes (Q2719239) (← links)
- On the global convergence of the BFGS method for nonconvex unconstrained optimization problems (Q2719240) (← links)
- An alternative method to crossing minimization on hierarchical graphs (Q2719241) (← links)
- Approximate max-min resource sharing for structured concave optimization (Q2719242) (← links)
- A computationally efficient feasible sequential quadratic programming algorithm (Q2719243) (← links)
- A nonlinear Lagrangian approach to constrained optimization problems (Q2719244) (← links)
- Corrigendum: On the constant positive linear dependence condition and its application to SQP methods (Q2719245) (← links)
- Error bounds for lower semicontinuous functions in normed spaces (Q2719246) (← links)
- Faster algorithms for the quickest transshipment problem (Q2719247) (← links)
- Effects of finite-precision arithmetic on interior-point methods for nonlinear programming (Q2719248) (← links)
- The ordered subsets mirror descent optimization method with applications to tomography (Q2784404) (← links)
- Incremental subgradient methods for nondifferentiable optimization (Q2784405) (← links)
- On second-order subdifferentials and their applications (Q2784406) (← links)
- Ample parameterization of variational inclusions (Q2784407) (← links)
- Minimizing a quadratic over a sphere (Q2784408) (← links)
- Reduced-Hessian quasi-Newton methods for unconstrained optimization (Q2784409) (← links)
- Rescaling and stepsize selection in proximal methods using separable generalized distances (Q2784410) (← links)
- Robust reduction of a class of large-scale linear programs (Q2784411) (← links)
- Analysis of inexact trust-region SQP algorithms (Q2784412) (← links)
- On the resolution of the generalized nonlinear complementarity problem (Q2784413) (← links)
- Measuring the goodness of orthogonal array discretizations for stochastic programming and stochastic dynamic programming (Q2784414) (← links)
- Tighter linear and semidefinite relaxations for max-cut based on the Lovász-Schrijver lift-and-project procedure (Q2784415) (← links)
- An augmented Lagrangian function with improved exactness properties (Q2784416) (← links)
- An appropriate subdifferential for quasiconvex functions (Q2784417) (← links)
- Sufficient conditions for error bounds (Q2784418) (← links)
- Smoothing functions for second-order-cone complementarity problems (Q2784419) (← links)
- A variational principle for problems with functional constraints (Q2784420) (← links)
- The sample average approximation method for stochastic discrete optimization (Q2784421) (← links)
- Rank-two relaxation heuristics for MAX-CUT and other binary quadratic programs (Q2784422) (← links)
- A primal-dual algorithm for solving polyhedral conic systems with a finite-precision machine (Q2784423) (← links)
- A class of globally convergent optimization methods based on conservative convex separable approximations (Q2784424) (← links)
- Integration of Fenchel subdifferentials of epi-pointed functions (Q2784425) (← links)
- A homotopy-based algorithm for mixed complementarity problems (Q2784426) (← links)
- A probability-one homotopy algorithm for nonsmooth equations and mixed complementarity problems (Q2784427) (← links)
- A new condition measure, preconditioners, and relations between different measures of conditioning for conic linear systems (Q2784428) (← links)
- A fuzzy necessary optimality condition for non-Lipschitz optimization in Asplund spaces (Q2784429) (← links)
- Solving some large scale semidefinite programs via the conjugate residual method (Q2784430) (← links)
- An interior-point approach to sensitivity analysis in degenerate linear programs (Q2784431) (← links)
- Self-scaled barriers for irreducible symmetric cones (Q2784432) (← links)
